/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:09:16,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:09:16,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:09:16,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:09:16,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:09:16,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:09:16,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:09:16,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:09:16,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:09:16,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:09:16,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:09:16,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:09:16,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:09:16,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:09:16,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:09:16,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:09:16,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:09:16,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:09:16,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:09:16,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:09:16,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:09:16,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:09:16,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:09:16,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:09:16,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:09:16,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:09:16,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:09:16,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:09:16,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:09:16,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:09:16,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:09:16,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:09:16,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:09:16,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:09:16,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:09:16,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:09:16,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:09:16,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:09:16,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:09:16,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:09:16,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:09:16,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:09:16,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:09:16,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:09:16,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:09:16,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:09:16,998 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:09:16,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:09:16,999 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:09:16,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:09:16,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:09:16,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:09:16,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:09:17,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:09:17,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:09:17,000 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:09:17,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:09:17,000 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:09:17,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:09:17,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:09:17,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:09:17,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:09:17,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:09:17,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:17,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:09:17,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:09:17,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:09:17,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:09:17,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:09:17,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:09:17,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:09:17,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:09:17,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:09:17,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:09:17,289 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:09:17,289 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:09:17,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-12-06 07:09:18,266 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:09:18,515 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:09:18,515 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-12-06 07:09:18,528 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc2469bd/71a92fee86f64b7ab66dc80c22a36922/FLAG09502368b [2022-12-06 07:09:18,541 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc2469bd/71a92fee86f64b7ab66dc80c22a36922 [2022-12-06 07:09:18,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:09:18,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:09:18,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:18,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:09:18,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:09:18,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd48f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18, skipping insertion in model container [2022-12-06 07:09:18,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:09:18,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:09:18,723 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2022-12-06 07:09:18,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:18,847 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:09:18,861 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2022-12-06 07:09:18,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:18,932 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:09:18,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18 WrapperNode [2022-12-06 07:09:18,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:18,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:18,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:09:18,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:09:18,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,972 INFO L138 Inliner]: procedures = 165, calls = 42, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 139 [2022-12-06 07:09:18,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:18,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:09:18,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:09:18,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:09:18,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:18,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:19,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:19,002 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:19,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:19,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:09:19,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:09:19,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:09:19,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:09:19,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (1/1) ... [2022-12-06 07:09:19,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:19,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:09:19,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:09:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:09:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 07:09:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:09:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:09:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-06 07:09:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-06 07:09:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:09:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:09:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:09:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:09:19,101 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:09:19,232 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:09:19,234 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:09:19,425 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:09:19,432 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:09:19,432 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 07:09:19,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:19 BoogieIcfgContainer [2022-12-06 07:09:19,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:09:19,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:09:19,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:09:19,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:09:19,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:09:18" (1/3) ... [2022-12-06 07:09:19,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb97f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:19, skipping insertion in model container [2022-12-06 07:09:19,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:18" (2/3) ... [2022-12-06 07:09:19,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb97f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:19, skipping insertion in model container [2022-12-06 07:09:19,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:19" (3/3) ... [2022-12-06 07:09:19,439 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-12-06 07:09:19,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:09:19,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 07:09:19,453 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:09:19,519 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 07:09:19,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 162 transitions, 329 flow [2022-12-06 07:09:19,655 INFO L130 PetriNetUnfolder]: 8/164 cut-off events. [2022-12-06 07:09:19,655 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:19,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 164 events. 8/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 149 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2022-12-06 07:09:19,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 162 transitions, 329 flow [2022-12-06 07:09:19,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 160 transitions, 323 flow [2022-12-06 07:09:19,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:19,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 160 transitions, 323 flow [2022-12-06 07:09:19,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 160 transitions, 323 flow [2022-12-06 07:09:19,745 INFO L130 PetriNetUnfolder]: 8/160 cut-off events. [2022-12-06 07:09:19,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:19,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 160 events. 8/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 141 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2022-12-06 07:09:19,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 160 transitions, 323 flow [2022-12-06 07:09:19,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 6570 [2022-12-06 07:09:25,658 INFO L203 LiptonReduction]: Total number of compositions: 143 [2022-12-06 07:09:25,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:09:25,684 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;@158aeefc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:09:25,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 07:09:25,688 INFO L130 PetriNetUnfolder]: 1/11 cut-off events. [2022-12-06 07:09:25,688 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:25,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:25,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 07:09:25,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash 19418430, now seen corresponding path program 1 times [2022-12-06 07:09:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:25,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609414637] [2022-12-06 07:09:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:25,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609414637] [2022-12-06 07:09:25,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609414637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:25,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:25,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:09:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992179332] [2022-12-06 07:09:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:25,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 07:09:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:25,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 07:09:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 07:09:25,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-06 07:09:25,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-06 07:09:25,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:25,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-06 07:09:25,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:25,907 INFO L130 PetriNetUnfolder]: 157/375 cut-off events. [2022-12-06 07:09:25,907 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:25,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 375 events. 157/375 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1703 event pairs, 144 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 698. Up to 328 conditions per place. [2022-12-06 07:09:25,910 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 24 selfloop transitions, 0 changer transitions 4/33 dead transitions. [2022-12-06 07:09:25,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 123 flow [2022-12-06 07:09:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 07:09:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 07:09:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-12-06 07:09:25,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 07:09:25,919 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 75 flow. Second operand 2 states and 42 transitions. [2022-12-06 07:09:25,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 123 flow [2022-12-06 07:09:25,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:25,922 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 60 flow [2022-12-06 07:09:25,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 07:09:25,925 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-06 07:09:25,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:25,926 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 60 flow [2022-12-06 07:09:25,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:25,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:25,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 60 flow [2022-12-06 07:09:25,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 60 flow [2022-12-06 07:09:25,933 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 07:09:25,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:25,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 07:09:25,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 29 transitions, 60 flow [2022-12-06 07:09:25,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 07:09:26,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:09:26,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 07:09:26,046 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 60 flow [2022-12-06 07:09:26,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-06 07:09:26,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:26,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 07:09:26,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:09:26,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1480565624, now seen corresponding path program 1 times [2022-12-06 07:09:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:26,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266010348] [2022-12-06 07:09:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266010348] [2022-12-06 07:09:26,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266010348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:26,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:09:26,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312158109] [2022-12-06 07:09:26,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:26,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:26,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:26,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 07:09:26,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-06 07:09:26,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:26,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 07:09:26,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:26,312 INFO L130 PetriNetUnfolder]: 117/319 cut-off events. [2022-12-06 07:09:26,312 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:26,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 319 events. 117/319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1401 event pairs, 12 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 592. Up to 152 conditions per place. [2022-12-06 07:09:26,314 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 38 selfloop transitions, 9 changer transitions 0/52 dead transitions. [2022-12-06 07:09:26,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 200 flow [2022-12-06 07:09:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 07:09:26,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2022-12-06 07:09:26,316 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 60 flow. Second operand 5 states and 74 transitions. [2022-12-06 07:09:26,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 200 flow [2022-12-06 07:09:26,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:09:26,317 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 109 flow [2022-12-06 07:09:26,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-12-06 07:09:26,318 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-06 07:09:26,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:26,318 INFO L89 Accepts]: Start accepts. Operand has 39 places, 34 transitions, 109 flow [2022-12-06 07:09:26,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:26,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:26,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 109 flow [2022-12-06 07:09:26,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 109 flow [2022-12-06 07:09:26,323 INFO L130 PetriNetUnfolder]: 2/67 cut-off events. [2022-12-06 07:09:26,324 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:09:26,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 67 events. 2/67 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 262 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 96. Up to 9 conditions per place. [2022-12-06 07:09:26,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 109 flow [2022-12-06 07:09:26,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 07:09:26,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] L738-->L21-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= |v_ULTIMATE.start_main_~x~1#1_52| v_~g~0_27) (= (+ |v_ULTIMATE.start_plus_#in~b#1_23| 17) 0) (= |v_ULTIMATE.start_plus_#in~a#1_23| |v_ULTIMATE.start_main_~x~1#1_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57| (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_44|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_44| |v_ULTIMATE.start_plus_~b#1_44| 2147483648))) 1 0)) (= |v_ULTIMATE.start_plus_#in~b#1_23| |v_ULTIMATE.start_plus_~b#1_44|) (= |v_ULTIMATE.start_plus_#in~a#1_23| |v_ULTIMATE.start_plus_~a#1_44|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_52|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_63|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_18|, ~g~0=v_~g~0_27, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_44|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_44|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_23|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_52|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [611] L21-3-->L739-5: Formula: (and (= |v_ULTIMATE.start_main_#t~ret13#1_Out_14| v_~h~0_Out_14) (<= 0 (+ |v_ULTIMATE.start_main_#t~ret13#1_Out_14| 2147483648)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_2| 0)) (= |v_ULTIMATE.start_main_#t~ret13#1_Out_14| |v_ULTIMATE.start_plus_#res#1_Out_14|) (<= |v_ULTIMATE.start_main_#t~ret13#1_Out_14| 2147483647) (= (+ |v_ULTIMATE.start_plus_~a#1_In_8| |v_ULTIMATE.start_plus_~b#1_In_7|) |v_ULTIMATE.start_plus_#res#1_Out_14|)) InVars {ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_In_8|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_In_7|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_2|} OutVars{~h~0=v_~h~0_Out_14, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_14|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_2|, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_Out_14|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_In_8|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_In_7|} AuxVars[] AssignedVars[~h~0, ULTIMATE.start_plus_#res#1, ULTIMATE.start_main_#t~ret13#1] [2022-12-06 07:09:26,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] L738-->L739-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_plus_~a#1_68| |v_ULTIMATE.start_plus_~b#1_68|))) (and (= (+ |v_ULTIMATE.start_plus_#in~b#1_37| 17) 0) (= .cse0 |v_ULTIMATE.start_plus_#res#1_46|) (= |v_ULTIMATE.start_main_~x~1#1_70| v_~g~0_49) (= |v_ULTIMATE.start_plus_#in~b#1_37| |v_ULTIMATE.start_plus_~b#1_68|) (not (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_68|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_68| |v_ULTIMATE.start_plus_~b#1_68| 2147483648))) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (ite (or (<= |v_ULTIMATE.start_plus_~b#1_68| 0) (<= .cse0 2147483647)) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_ULTIMATE.start_plus_#in~a#1_37| |v_ULTIMATE.start_main_~x~1#1_70|) (= |v_ULTIMATE.start_plus_#res#1_46| |v_ULTIMATE.start_main_#t~ret13#1_68|) (= |v_ULTIMATE.start_plus_#in~a#1_37| |v_ULTIMATE.start_plus_~a#1_68|))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_70|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_37|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_46|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~g~0=v_~g~0_49, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_68|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_68|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_68|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_37|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_70|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [611] L21-3-->L739-5: Formula: (and (= |v_ULTIMATE.start_main_#t~ret13#1_Out_14| v_~h~0_Out_14) (<= 0 (+ |v_ULTIMATE.start_main_#t~ret13#1_Out_14| 2147483648)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_2| 0)) (= |v_ULTIMATE.start_main_#t~ret13#1_Out_14| |v_ULTIMATE.start_plus_#res#1_Out_14|) (<= |v_ULTIMATE.start_main_#t~ret13#1_Out_14| 2147483647) (= (+ |v_ULTIMATE.start_plus_~a#1_In_8| |v_ULTIMATE.start_plus_~b#1_In_7|) |v_ULTIMATE.start_plus_#res#1_Out_14|)) InVars {ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_In_8|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_In_7|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_2|} OutVars{~h~0=v_~h~0_Out_14, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_14|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_2|, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_Out_14|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_In_8|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_In_7|} AuxVars[] AssignedVars[~h~0, ULTIMATE.start_plus_#res#1, ULTIMATE.start_main_#t~ret13#1] [2022-12-06 07:09:26,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:09:26,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 07:09:26,616 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 129 flow [2022-12-06 07:09:26,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-06 07:09:26,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:26,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:26,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:09:26,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1347105597, now seen corresponding path program 1 times [2022-12-06 07:09:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:26,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736396653] [2022-12-06 07:09:26,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:26,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736396653] [2022-12-06 07:09:26,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736396653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:26,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:26,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218992660] [2022-12-06 07:09:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:26,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:09:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:26,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:09:26,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:09:26,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-06 07:09:26,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:26,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:26,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-06 07:09:26,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:26,906 INFO L130 PetriNetUnfolder]: 124/339 cut-off events. [2022-12-06 07:09:26,906 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 07:09:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 339 events. 124/339 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1628 event pairs, 36 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 753. Up to 146 conditions per place. [2022-12-06 07:09:26,910 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 46 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2022-12-06 07:09:26,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 314 flow [2022-12-06 07:09:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:09:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:09:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-06 07:09:26,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 07:09:26,913 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 129 flow. Second operand 8 states and 104 transitions. [2022-12-06 07:09:26,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 314 flow [2022-12-06 07:09:26,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 304 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:26,917 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 178 flow [2022-12-06 07:09:26,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=178, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-06 07:09:26,918 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2022-12-06 07:09:26,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:26,918 INFO L89 Accepts]: Start accepts. Operand has 48 places, 40 transitions, 178 flow [2022-12-06 07:09:26,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:26,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:26,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 178 flow [2022-12-06 07:09:26,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 178 flow [2022-12-06 07:09:26,927 INFO L130 PetriNetUnfolder]: 5/87 cut-off events. [2022-12-06 07:09:26,927 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 07:09:26,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 87 events. 5/87 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 393 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 155. Up to 14 conditions per place. [2022-12-06 07:09:26,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 178 flow [2022-12-06 07:09:26,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 07:09:26,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [607] L738-->L21-3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| (ite (or (<= (+ |v_ULTIMATE.start_plus_~b#1_Out_8| |v_ULTIMATE.start_plus_~a#1_Out_8|) 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_Out_8| 0)) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= |v_ULTIMATE.start_main_~x~1#1_In_4| v_~g~0_Out_6) (= |v_ULTIMATE.start_main_~x~1#1_In_4| |v_ULTIMATE.start_plus_#in~a#1_Out_4|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_Out_4| 17) 0) (= |v_ULTIMATE.start_plus_#in~b#1_Out_4| |v_ULTIMATE.start_plus_~b#1_Out_8|) (not (= (ite (or (<= 0 (+ |v_ULTIMATE.start_plus_~b#1_Out_8| 2147483648 |v_ULTIMATE.start_plus_~a#1_Out_8|)) (<= 0 |v_ULTIMATE.start_plus_~b#1_Out_8|)) 1 0) 0)) (= |v_ULTIMATE.start_plus_#in~a#1_Out_4| |v_ULTIMATE.start_plus_~a#1_Out_8|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_4|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_Out_4|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_Out_10|, ~g~0=v_~g~0_Out_6, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_Out_8|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_Out_8|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_Out_4|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_In_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_18|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:09:27,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [598] L738-->L21-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_63| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= |v_ULTIMATE.start_main_~x~1#1_52| v_~g~0_27) (= (+ |v_ULTIMATE.start_plus_#in~b#1_23| 17) 0) (= |v_ULTIMATE.start_plus_#in~a#1_23| |v_ULTIMATE.start_main_~x~1#1_52|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57| (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_44|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_44| |v_ULTIMATE.start_plus_~b#1_44| 2147483648))) 1 0)) (= |v_ULTIMATE.start_plus_#in~b#1_23| |v_ULTIMATE.start_plus_~b#1_44|) (= |v_ULTIMATE.start_plus_#in~a#1_23| |v_ULTIMATE.start_plus_~a#1_44|)) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_52|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_63|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_18|, ~g~0=v_~g~0_27, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_44|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_44|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_23|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_52|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:09:27,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [618] L738-->L739-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_plus_~a#1_68| |v_ULTIMATE.start_plus_~b#1_68|))) (and (= (+ |v_ULTIMATE.start_plus_#in~b#1_37| 17) 0) (= .cse0 |v_ULTIMATE.start_plus_#res#1_46|) (= |v_ULTIMATE.start_main_~x~1#1_70| v_~g~0_49) (= |v_ULTIMATE.start_plus_#in~b#1_37| |v_ULTIMATE.start_plus_~b#1_68|) (not (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_68|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_68| |v_ULTIMATE.start_plus_~b#1_68| 2147483648))) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (ite (or (<= |v_ULTIMATE.start_plus_~b#1_68| 0) (<= .cse0 2147483647)) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_ULTIMATE.start_plus_#in~a#1_37| |v_ULTIMATE.start_main_~x~1#1_70|) (= |v_ULTIMATE.start_plus_#res#1_46| |v_ULTIMATE.start_main_#t~ret13#1_68|) (= |v_ULTIMATE.start_plus_#in~a#1_37| |v_ULTIMATE.start_plus_~a#1_68|))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_70|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_37|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_46|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~g~0=v_~g~0_49, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_68|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_68|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_68|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_37|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_70|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ULTIMATE.start_plus_#res#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:09:27,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [574] L715-1-->L717: Formula: (= v_~g~0_13 |v_t_funThread1of1ForFork0_~x~0#1_95|) InVars {~g~0=v_~g~0_13} OutVars{t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_95|, ~g~0=v_~g~0_13, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_13|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~x~0#1, t_funThread1of1ForFork0_#t~nondet5#1] and [626] L738-->L739-5: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_plus_~a#1_116| |v_ULTIMATE.start_plus_~b#1_116|))) (and (<= |v_ULTIMATE.start_main_#t~ret13#1_98| 2147483647) (= .cse0 |v_ULTIMATE.start_plus_#res#1_96|) (= |v_ULTIMATE.start_main_~x~1#1_88| v_~g~0_95) (= |v_ULTIMATE.start_plus_#res#1_96| |v_ULTIMATE.start_main_#t~ret13#1_98|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111| (ite (or (<= .cse0 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_116| 0)) 1 0)) (= v_~h~0_91 |v_ULTIMATE.start_main_#t~ret13#1_98|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_135|) (<= 0 (+ |v_ULTIMATE.start_main_#t~ret13#1_98| 2147483648)) (= (+ |v_ULTIMATE.start_plus_#in~b#1_77| 17) 0) (= |v_ULTIMATE.start_plus_#in~b#1_77| |v_ULTIMATE.start_plus_~b#1_116|) (= |v_ULTIMATE.start_plus_~a#1_116| |v_ULTIMATE.start_plus_#in~a#1_77|) (= |v_ULTIMATE.start_plus_#in~a#1_77| |v_ULTIMATE.start_main_~x~1#1_88|))) InVars {ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_88|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_77|, ~h~0=v_~h~0_91, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_96|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_135|, ~g~0=v_~g~0_95, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_98|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_116|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_116|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_77|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_88|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, ~h~0, ULTIMATE.start_plus_#res#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 07:09:27,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L715-1-->L21-3: Formula: (and (= v_~g~0_107 |v_t_funThread1of1ForFork0_~x~0#1_391|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_86| 17) 0) (not (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_125|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_125| |v_ULTIMATE.start_plus_~b#1_125| 2147483648))) 1 0) 0)) (= |v_ULTIMATE.start_plus_~a#1_125| |v_ULTIMATE.start_plus_#in~a#1_86|) (= |v_ULTIMATE.start_plus_#in~b#1_86| |v_ULTIMATE.start_plus_~b#1_125|) (= |v_ULTIMATE.start_plus_#in~a#1_86| |v_ULTIMATE.start_main_~x~1#1_101|) (= (ite (or (<= (+ |v_ULTIMATE.start_plus_~a#1_125| |v_ULTIMATE.start_plus_~b#1_125|) 2147483647) (<= |v_ULTIMATE.start_plus_~b#1_125| 0)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_120|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_120| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_144|) (= v_~g~0_106 |v_ULTIMATE.start_main_~x~1#1_101|)) InVars {~g~0=v_~g~0_107, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_101|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_86|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_391|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_144|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_111|, ~g~0=v_~g~0_106, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_125|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_125|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_86|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_101|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_120|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_117|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, t_funThread1of1ForFork0_~x~0#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] and [577] L717-->L19-1: Formula: (and (= v_~h~0_29 |v_t_funThread1of1ForFork0_~y~0#1_39|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79| (ite (<= |v_t_funThread1of1ForFork0_~y~0#1_39| |v_t_funThread1of1ForFork0_~x~0#1_99|) 1 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_125| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_99|, ~h~0=v_~h~0_29} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_99|, ~h~0=v_~h~0_29, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_39|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_125|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] [2022-12-06 07:09:27,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L715-1-->L21-1: Formula: (and (= v_~g~0_110 |v_ULTIMATE.start_main_~x~1#1_103|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_146| 0) (= |v_ULTIMATE.start_plus_~a#1_127| |v_ULTIMATE.start_plus_#in~a#1_88|) (= (+ |v_ULTIMATE.start_plus_#in~b#1_88| 17) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_122| (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_127|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_127| |v_ULTIMATE.start_plus_~b#1_127| 2147483648))) 1 0)) (= v_~g~0_111 |v_t_funThread1of1ForFork0_~x~0#1_393|) (= |v_ULTIMATE.start_plus_#in~b#1_88| |v_ULTIMATE.start_plus_~b#1_127|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_122| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_146|) (= |v_ULTIMATE.start_plus_#in~a#1_88| |v_ULTIMATE.start_main_~x~1#1_103|)) InVars {~g~0=v_~g~0_111, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_103|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_88|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_393|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_146|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_113|, ~g~0=v_~g~0_110, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_127|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_127|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_88|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_103|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_122|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_119|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, t_funThread1of1ForFork0_~x~0#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_plus_#res#1, ~g~0, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] and [577] L717-->L19-1: Formula: (and (= v_~h~0_29 |v_t_funThread1of1ForFork0_~y~0#1_39|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79| (ite (<= |v_t_funThread1of1ForFork0_~y~0#1_39| |v_t_funThread1of1ForFork0_~x~0#1_99|) 1 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_125| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_99|, ~h~0=v_~h~0_29} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_99|, ~h~0=v_~h~0_29, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_39|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_125|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] [2022-12-06 07:09:27,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [631] L715-1-->L739-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_plus_~a#1_129| |v_ULTIMATE.start_plus_~b#1_129|))) (and (= v_~g~0_115 |v_t_funThread1of1ForFork0_~x~0#1_395|) (= (ite (or (<= |v_ULTIMATE.start_plus_~b#1_129| 0) (<= .cse0 2147483647)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_124|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_124| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_148|) (not (= (ite (or (<= 0 |v_ULTIMATE.start_plus_~b#1_129|) (<= 0 (+ |v_ULTIMATE.start_plus_~a#1_129| |v_ULTIMATE.start_plus_~b#1_129| 2147483648))) 1 0) 0)) (= (+ |v_ULTIMATE.start_plus_#in~b#1_90| 17) 0) (= |v_ULTIMATE.start_plus_#res#1_115| |v_ULTIMATE.start_main_#t~ret13#1_109|) (= |v_ULTIMATE.start_plus_#in~a#1_90| |v_ULTIMATE.start_main_~x~1#1_105|) (= .cse0 |v_ULTIMATE.start_plus_#res#1_115|) (= |v_ULTIMATE.start_plus_#in~b#1_90| |v_ULTIMATE.start_plus_~b#1_129|) (= v_~g~0_114 |v_ULTIMATE.start_main_~x~1#1_105|) (= |v_ULTIMATE.start_plus_~a#1_129| |v_ULTIMATE.start_plus_#in~a#1_90|))) InVars {~g~0=v_~g~0_115, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_105|} OutVars{ULTIMATE.start_plus_#in~b#1=|v_ULTIMATE.start_plus_#in~b#1_90|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_395|, ULTIMATE.start_plus_#res#1=|v_ULTIMATE.start_plus_#res#1_115|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_148|, ~g~0=v_~g~0_114, ULTIMATE.start_main_#t~ret13#1=|v_ULTIMATE.start_main_#t~ret13#1_109|, ULTIMATE.start_plus_~a#1=|v_ULTIMATE.start_plus_~a#1_129|, ULTIMATE.start_plus_~b#1=|v_ULTIMATE.start_plus_~b#1_129|, ULTIMATE.start_plus_#in~a#1=|v_ULTIMATE.start_plus_#in~a#1_90|, ULTIMATE.start_main_~x~1#1=|v_ULTIMATE.start_main_~x~1#1_105|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_124|, t_funThread1of1ForFork0_#t~nondet5#1=|v_t_funThread1of1ForFork0_#t~nondet5#1_121|} AuxVars[] AssignedVars[ULTIMATE.start_plus_#in~b#1, t_funThread1of1ForFork0_~x~0#1, ULTIMATE.start_plus_#res#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~g~0, ULTIMATE.start_main_#t~ret13#1, ULTIMATE.start_plus_~a#1, ULTIMATE.start_plus_~b#1, ULTIMATE.start_plus_#in~a#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_#t~nondet5#1] and [577] L717-->L19-1: Formula: (and (= v_~h~0_29 |v_t_funThread1of1ForFork0_~y~0#1_39|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79| (ite (<= |v_t_funThread1of1ForFork0_~y~0#1_39| |v_t_funThread1of1ForFork0_~x~0#1_99|) 1 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_125| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_99|, ~h~0=v_~h~0_29} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_79|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_99|, ~h~0=v_~h~0_29, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_39|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_125|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] [2022-12-06 07:09:27,488 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:09:27,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-06 07:09:27,489 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 188 flow [2022-12-06 07:09:27,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:27,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:27,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:27,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:09:27,490 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash 758760928, now seen corresponding path program 1 times [2022-12-06 07:09:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:27,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194427796] [2022-12-06 07:09:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:27,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194427796] [2022-12-06 07:09:27,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194427796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:27,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:27,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826277460] [2022-12-06 07:09:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:27,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:27,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 07:09:27,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:27,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:27,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 07:09:27,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:27,609 INFO L130 PetriNetUnfolder]: 103/284 cut-off events. [2022-12-06 07:09:27,609 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-06 07:09:27,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 284 events. 103/284 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1156 event pairs, 39 based on Foata normal form. 16/274 useless extension candidates. Maximal degree in co-relation 672. Up to 143 conditions per place. [2022-12-06 07:09:27,610 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 37 selfloop transitions, 8 changer transitions 2/49 dead transitions. [2022-12-06 07:09:27,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 277 flow [2022-12-06 07:09:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 07:09:27,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-06 07:09:27,612 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 188 flow. Second operand 3 states and 53 transitions. [2022-12-06 07:09:27,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 277 flow [2022-12-06 07:09:27,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 239 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 07:09:27,614 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 137 flow [2022-12-06 07:09:27,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-06 07:09:27,615 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 07:09:27,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:27,615 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 137 flow [2022-12-06 07:09:27,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:27,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:27,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 137 flow [2022-12-06 07:09:27,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 137 flow [2022-12-06 07:09:27,621 INFO L130 PetriNetUnfolder]: 6/82 cut-off events. [2022-12-06 07:09:27,621 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 07:09:27,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 82 events. 6/82 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 275 event pairs, 3 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 146. Up to 22 conditions per place. [2022-12-06 07:09:27,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 137 flow [2022-12-06 07:09:27,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 07:09:28,037 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:09:28,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 423 [2022-12-06 07:09:28,038 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 138 flow [2022-12-06 07:09:28,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:28,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:28,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:28,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:09:28,039 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:28,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1363111045, now seen corresponding path program 1 times [2022-12-06 07:09:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:28,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771091423] [2022-12-06 07:09:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:28,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:28,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:28,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771091423] [2022-12-06 07:09:28,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771091423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:28,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:28,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933470340] [2022-12-06 07:09:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:28,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:28,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 07:09:28,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:28,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:28,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 07:09:28,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:28,212 INFO L130 PetriNetUnfolder]: 80/223 cut-off events. [2022-12-06 07:09:28,212 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 07:09:28,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 223 events. 80/223 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 988 event pairs, 49 based on Foata normal form. 18/208 useless extension candidates. Maximal degree in co-relation 621. Up to 124 conditions per place. [2022-12-06 07:09:28,213 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 32 selfloop transitions, 5 changer transitions 10/49 dead transitions. [2022-12-06 07:09:28,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 304 flow [2022-12-06 07:09:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 07:09:28,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-06 07:09:28,214 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 138 flow. Second operand 4 states and 50 transitions. [2022-12-06 07:09:28,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 304 flow [2022-12-06 07:09:28,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 276 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:09:28,216 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 134 flow [2022-12-06 07:09:28,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-06 07:09:28,217 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 07:09:28,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:28,217 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 134 flow [2022-12-06 07:09:28,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:28,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:28,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 134 flow [2022-12-06 07:09:28,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 134 flow [2022-12-06 07:09:28,223 INFO L130 PetriNetUnfolder]: 8/83 cut-off events. [2022-12-06 07:09:28,223 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 07:09:28,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 83 events. 8/83 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 371 event pairs, 4 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 182. Up to 27 conditions per place. [2022-12-06 07:09:28,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 134 flow [2022-12-06 07:09:28,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 07:09:28,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L735-1-->L738: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1511| |v_~#A~0.base_329|))) (and (= (select .cse0 |v_~#A~0.offset_329|) 0) (= v_~i~0_190 11) (= (store |v_#pthreadsMutex_1511| |v_~#A~0.base_329| (store .cse0 |v_~#A~0.offset_329| 1)) |v_#pthreadsMutex_1510|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1511|, ~#A~0.offset=|v_~#A~0.offset_329|, ~#A~0.base=|v_~#A~0.base_329|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1510|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_189|, ~#A~0.offset=|v_~#A~0.offset_329|, ~i~0=v_~i~0_190, ~#A~0.base=|v_~#A~0.base_329|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_104|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ~i~0, ULTIMATE.start_main_#t~nondet12#1] and [615] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_83| |v_t_funThread1of1ForFork0_plus_~b#1_85|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483648)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_85| 0)) 1 0)) (<= |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483647) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| .cse0) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| v_~i~0_98))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_83|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~i~0=v_~i~0_98, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_47|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] [2022-12-06 07:09:28,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [298] L746-->L747: Formula: (= 3 v_~i~0_3) InVars {} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[~i~0] and [615] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_83| |v_t_funThread1of1ForFork0_plus_~b#1_85|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483648)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_85| 0)) 1 0)) (<= |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483647) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| .cse0) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| v_~i~0_98))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_83|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~i~0=v_~i~0_98, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_47|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] [2022-12-06 07:09:28,488 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:09:28,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 07:09:28,489 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 155 flow [2022-12-06 07:09:28,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:28,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:28,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:28,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:09:28,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1081239672, now seen corresponding path program 1 times [2022-12-06 07:09:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:28,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325873496] [2022-12-06 07:09:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325873496] [2022-12-06 07:09:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325873496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:28,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:28,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:09:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268616687] [2022-12-06 07:09:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:28,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:28,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:28,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 07:09:28,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:28,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:28,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 07:09:28,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:28,599 INFO L130 PetriNetUnfolder]: 56/176 cut-off events. [2022-12-06 07:09:28,599 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 07:09:28,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 176 events. 56/176 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 804 event pairs, 41 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 527. Up to 145 conditions per place. [2022-12-06 07:09:28,600 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 31 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2022-12-06 07:09:28,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 240 flow [2022-12-06 07:09:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 07:09:28,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2022-12-06 07:09:28,601 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 155 flow. Second operand 3 states and 38 transitions. [2022-12-06 07:09:28,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 240 flow [2022-12-06 07:09:28,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:28,603 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 147 flow [2022-12-06 07:09:28,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-06 07:09:28,603 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 07:09:28,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:28,604 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 147 flow [2022-12-06 07:09:28,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:28,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:28,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 147 flow [2022-12-06 07:09:28,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 147 flow [2022-12-06 07:09:28,610 INFO L130 PetriNetUnfolder]: 8/82 cut-off events. [2022-12-06 07:09:28,610 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 07:09:28,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 82 events. 8/82 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 366 event pairs, 3 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 187. Up to 27 conditions per place. [2022-12-06 07:09:28,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 147 flow [2022-12-06 07:09:28,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 07:09:28,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_83| |v_t_funThread1of1ForFork0_plus_~b#1_85|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483648)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_85| 0)) 1 0)) (<= |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483647) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| .cse0) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| v_~i~0_98))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_83|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~i~0=v_~i~0_98, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_47|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] and [644] L735-1-->L738: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1511| |v_~#A~0.base_329|))) (and (= (select .cse0 |v_~#A~0.offset_329|) 0) (= v_~i~0_190 11) (= (store |v_#pthreadsMutex_1511| |v_~#A~0.base_329| (store .cse0 |v_~#A~0.offset_329| 1)) |v_#pthreadsMutex_1510|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1511|, ~#A~0.offset=|v_~#A~0.offset_329|, ~#A~0.base=|v_~#A~0.base_329|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1510|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_189|, ~#A~0.offset=|v_~#A~0.offset_329|, ~i~0=v_~i~0_190, ~#A~0.base=|v_~#A~0.base_329|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_104|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ~i~0, ULTIMATE.start_main_#t~nondet12#1] [2022-12-06 07:09:28,675 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] L21-->L723: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_83| |v_t_funThread1of1ForFork0_plus_~b#1_85|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483648)) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49| (ite (or (<= .cse0 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_85| 0)) 1 0)) (<= |v_t_funThread1of1ForFork0_plus_#res#1_83| 2147483647) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| .cse0) (= |v_t_funThread1of1ForFork0_plus_#res#1_83| v_~i~0_98))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_78|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_83|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_83|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~i~0=v_~i~0_98, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_85|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_77|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_47|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] and [298] L746-->L747: Formula: (= 3 v_~i~0_3) InVars {} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[~i~0] [2022-12-06 07:09:28,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L21-->L747: Formula: (let ((.cse0 (+ |v_t_funThread1of1ForFork0_plus_~a#1_149| |v_t_funThread1of1ForFork0_plus_~b#1_151|))) (and (= |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_127| (ite (or (<= |v_t_funThread1of1ForFork0_plus_~b#1_151| 0) (<= .cse0 2147483647)) 1 0)) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_161| 2147483648)) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_182| 0)) (<= |v_t_funThread1of1ForFork0_plus_#res#1_161| 2147483647) (= 3 v_~i~0_208) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_181| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (= .cse0 |v_t_funThread1of1ForFork0_plus_#res#1_161|))) InVars {t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_149|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_151|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_182|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_161|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_149|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|, ~i~0=v_~i~0_208, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_151|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_181|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_85|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_#t~ret7#1] and [581] L723-->t_funErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_139| 0) (= v_~i~0_69 |v_t_funThread1of1ForFork0_~z~0#1_39|) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_89| (ite (<= |v_t_funThread1of1ForFork0_~x~0#1_109| |v_t_funThread1of1ForFork0_~z~0#1_39|) 1 0)) (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_139| |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_89|)) InVars {t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_109|, ~i~0=v_~i~0_69} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_89|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_109|, ~i~0=v_~i~0_69, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_139|, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_39|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_~z~0#1] [2022-12-06 07:09:28,802 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:09:28,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 07:09:28,803 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 147 flow [2022-12-06 07:09:28,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:28,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:28,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:28,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:09:28,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 841480264, now seen corresponding path program 1 times [2022-12-06 07:09:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:28,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493480690] [2022-12-06 07:09:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:28,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:28,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493480690] [2022-12-06 07:09:28,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493480690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:28,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:28,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447286562] [2022-12-06 07:09:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:28,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:28,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:28,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:28,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 07:09:28,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:28,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:28,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 07:09:28,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:28,989 INFO L130 PetriNetUnfolder]: 40/137 cut-off events. [2022-12-06 07:09:28,989 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-06 07:09:28,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 137 events. 40/137 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 619 event pairs, 20 based on Foata normal form. 6/133 useless extension candidates. Maximal degree in co-relation 410. Up to 85 conditions per place. [2022-12-06 07:09:28,990 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 23 selfloop transitions, 7 changer transitions 1/34 dead transitions. [2022-12-06 07:09:28,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 223 flow [2022-12-06 07:09:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 07:09:28,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 07:09:28,992 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 147 flow. Second operand 5 states and 40 transitions. [2022-12-06 07:09:28,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 223 flow [2022-12-06 07:09:28,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 210 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 07:09:28,995 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 142 flow [2022-12-06 07:09:28,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 07:09:28,995 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 07:09:28,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:28,995 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 142 flow [2022-12-06 07:09:28,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:28,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:28,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 142 flow [2022-12-06 07:09:28,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 142 flow [2022-12-06 07:09:29,002 INFO L130 PetriNetUnfolder]: 8/74 cut-off events. [2022-12-06 07:09:29,003 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 07:09:29,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 74 events. 8/74 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 308 event pairs, 3 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 172. Up to 28 conditions per place. [2022-12-06 07:09:29,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 142 flow [2022-12-06 07:09:29,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 07:09:29,004 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:29,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:09:29,006 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 142 flow [2022-12-06 07:09:29,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:29,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:29,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:09:29,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash 841309192, now seen corresponding path program 1 times [2022-12-06 07:09:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:29,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010545366] [2022-12-06 07:09:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:29,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:29,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010545366] [2022-12-06 07:09:29,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010545366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:29,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:29,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:09:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453765126] [2022-12-06 07:09:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:29,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:09:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:29,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:09:29,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:09:29,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:09:29,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-06 07:09:29,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:29,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:09:29,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:29,216 INFO L130 PetriNetUnfolder]: 39/131 cut-off events. [2022-12-06 07:09:29,216 INFO L131 PetriNetUnfolder]: For 58/59 co-relation queries the response was YES. [2022-12-06 07:09:29,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 131 events. 39/131 cut-off events. For 58/59 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 556 event pairs, 13 based on Foata normal form. 6/128 useless extension candidates. Maximal degree in co-relation 404. Up to 65 conditions per place. [2022-12-06 07:09:29,217 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 26 selfloop transitions, 8 changer transitions 1/36 dead transitions. [2022-12-06 07:09:29,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 244 flow [2022-12-06 07:09:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 07:09:29,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-06 07:09:29,218 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 142 flow. Second operand 4 states and 38 transitions. [2022-12-06 07:09:29,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 244 flow [2022-12-06 07:09:29,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:29,219 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 150 flow [2022-12-06 07:09:29,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-06 07:09:29,219 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 07:09:29,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:29,219 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 150 flow [2022-12-06 07:09:29,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:29,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:29,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 150 flow [2022-12-06 07:09:29,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 150 flow [2022-12-06 07:09:29,225 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2022-12-06 07:09:29,225 INFO L131 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2022-12-06 07:09:29,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 67 events. 6/67 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 267 event pairs, 1 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 177. Up to 24 conditions per place. [2022-12-06 07:09:29,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 150 flow [2022-12-06 07:09:29,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 07:09:29,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] L734-3-->L735-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_222| |v_~#B~0.base_55|))) (and (= (store |v_#pthreadsMutex_222| |v_~#B~0.base_55| (store .cse0 |v_~#B~0.offset_55| 1)) |v_#pthreadsMutex_221|) (= |v_ULTIMATE.start_main_#t~nondet11#1_10| 0) (= (select .cse0 |v_~#B~0.offset_55|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_222|, ~#B~0.base=|v_~#B~0.base_55|, ~#B~0.offset=|v_~#B~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_221|, ~#B~0.base=|v_~#B~0.base_55|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_10|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_9|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_13|, ~#B~0.offset=|v_~#B~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1] and [649] L21-->L738: Formula: (let ((.cse1 (+ |v_t_funThread1of1ForFork0_plus_~a#1_147| |v_t_funThread1of1ForFork0_plus_~b#1_149|)) (.cse0 (select |v_#pthreadsMutex_1563| |v_~#A~0.base_349|))) (and (= (store |v_#pthreadsMutex_1563| |v_~#A~0.base_349| (store .cse0 |v_~#A~0.offset_349| 1)) |v_#pthreadsMutex_1562|) (<= |v_t_funThread1of1ForFork0_plus_#res#1_159| 2147483647) (= (ite (or (<= .cse1 2147483647) (<= |v_t_funThread1of1ForFork0_plus_~b#1_149| 0)) 1 0) |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|) (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_177| |v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|) (= v_~i~0_204 11) (not (= |v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_178| 0)) (= .cse1 |v_t_funThread1of1ForFork0_plus_#res#1_159|) (= (select .cse0 |v_~#A~0.offset_349|) 0) (<= 0 (+ |v_t_funThread1of1ForFork0_plus_#res#1_159| 2147483648)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_1563|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_147|, ~#A~0.offset=|v_~#A~0.offset_349|, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_149|, ~#A~0.base=|v_~#A~0.base_349|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_178|} OutVars{t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_159|, #pthreadsMutex=|v_#pthreadsMutex_1562|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_147|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_195|, ~#A~0.offset=|v_~#A~0.offset_349|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|, ~i~0=v_~i~0_204, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_149|, ~#A~0.base=|v_~#A~0.base_349|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_177|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_110|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_83|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_plus_#res#1, #pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i~0, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet12#1, t_funThread1of1ForFork0_#t~ret7#1] [2022-12-06 07:09:29,700 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:09:29,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 482 [2022-12-06 07:09:29,701 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 156 flow [2022-12-06 07:09:29,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-06 07:09:29,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:29,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:29,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:09:29,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1341395782, now seen corresponding path program 1 times [2022-12-06 07:09:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:29,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45825285] [2022-12-06 07:09:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:29,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:29,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45825285] [2022-12-06 07:09:29,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45825285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:29,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:29,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:29,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584043309] [2022-12-06 07:09:29,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:29,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:09:29,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:29,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:09:29,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:09:29,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 07:09:29,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:29,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:29,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 07:09:29,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:29,858 INFO L130 PetriNetUnfolder]: 26/102 cut-off events. [2022-12-06 07:09:29,858 INFO L131 PetriNetUnfolder]: For 69/71 co-relation queries the response was YES. [2022-12-06 07:09:29,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 102 events. 26/102 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 434 event pairs, 14 based on Foata normal form. 8/104 useless extension candidates. Maximal degree in co-relation 362. Up to 60 conditions per place. [2022-12-06 07:09:29,859 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 19 selfloop transitions, 6 changer transitions 8/35 dead transitions. [2022-12-06 07:09:29,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 258 flow [2022-12-06 07:09:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:09:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:09:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-12-06 07:09:29,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24 [2022-12-06 07:09:29,860 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 156 flow. Second operand 7 states and 42 transitions. [2022-12-06 07:09:29,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 258 flow [2022-12-06 07:09:29,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 240 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:29,862 INFO L231 Difference]: Finished difference. Result has 46 places, 23 transitions, 141 flow [2022-12-06 07:09:29,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=46, PETRI_TRANSITIONS=23} [2022-12-06 07:09:29,863 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2022-12-06 07:09:29,863 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:29,863 INFO L89 Accepts]: Start accepts. Operand has 46 places, 23 transitions, 141 flow [2022-12-06 07:09:29,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:29,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:29,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 23 transitions, 141 flow [2022-12-06 07:09:29,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 141 flow [2022-12-06 07:09:29,869 INFO L130 PetriNetUnfolder]: 5/46 cut-off events. [2022-12-06 07:09:29,869 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-06 07:09:29,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 46 events. 5/46 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 172 event pairs, 1 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 124. Up to 22 conditions per place. [2022-12-06 07:09:29,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 141 flow [2022-12-06 07:09:29,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 07:09:30,225 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:09:30,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 363 [2022-12-06 07:09:30,226 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 129 flow [2022-12-06 07:09:30,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:30,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:30,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:30,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:09:30,226 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1341243807, now seen corresponding path program 1 times [2022-12-06 07:09:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:30,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106432660] [2022-12-06 07:09:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:30,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106432660] [2022-12-06 07:09:30,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106432660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:30,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:30,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399341940] [2022-12-06 07:09:30,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:30,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:30,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:30,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:09:30,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-06 07:09:30,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:30,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:09:30,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:30,315 INFO L130 PetriNetUnfolder]: 9/44 cut-off events. [2022-12-06 07:09:30,315 INFO L131 PetriNetUnfolder]: For 81/84 co-relation queries the response was YES. [2022-12-06 07:09:30,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 44 events. 9/44 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 4 based on Foata normal form. 8/52 useless extension candidates. Maximal degree in co-relation 159. Up to 27 conditions per place. [2022-12-06 07:09:30,316 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 12 selfloop transitions, 3 changer transitions 3/21 dead transitions. [2022-12-06 07:09:30,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 21 transitions, 167 flow [2022-12-06 07:09:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-06 07:09:30,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2022-12-06 07:09:30,316 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 129 flow. Second operand 4 states and 25 transitions. [2022-12-06 07:09:30,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 21 transitions, 167 flow [2022-12-06 07:09:30,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 146 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-06 07:09:30,317 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 100 flow [2022-12-06 07:09:30,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2022-12-06 07:09:30,318 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -7 predicate places. [2022-12-06 07:09:30,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:30,318 INFO L89 Accepts]: Start accepts. Operand has 30 places, 17 transitions, 100 flow [2022-12-06 07:09:30,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:30,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:30,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 17 transitions, 100 flow [2022-12-06 07:09:30,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 17 transitions, 100 flow [2022-12-06 07:09:30,321 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 07:09:30,322 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-12-06 07:09:30,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 31 events. 3/31 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 88. Up to 18 conditions per place. [2022-12-06 07:09:30,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 17 transitions, 100 flow [2022-12-06 07:09:30,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 07:09:30,329 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:30,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:09:30,329 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 100 flow [2022-12-06 07:09:30,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-06 07:09:30,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:30,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:30,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:09:30,330 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-06 07:09:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1383003102, now seen corresponding path program 1 times [2022-12-06 07:09:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:30,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637008504] [2022-12-06 07:09:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:30,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637008504] [2022-12-06 07:09:30,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637008504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:30,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:30,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176333553] [2022-12-06 07:09:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:30,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:30,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:30,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 07:09:30,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:30,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:30,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 07:09:30,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:30,467 INFO L130 PetriNetUnfolder]: 2/22 cut-off events. [2022-12-06 07:09:30,468 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 07:09:30,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 22 events. 2/22 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 2/23 useless extension candidates. Maximal degree in co-relation 78. Up to 16 conditions per place. [2022-12-06 07:09:30,468 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2022-12-06 07:09:30,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 14 transitions, 110 flow [2022-12-06 07:09:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-12-06 07:09:30,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-06 07:09:30,469 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 100 flow. Second operand 4 states and 20 transitions. [2022-12-06 07:09:30,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 14 transitions, 110 flow [2022-12-06 07:09:30,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 14 transitions, 96 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 07:09:30,469 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2022-12-06 07:09:30,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=27, PETRI_TRANSITIONS=0} [2022-12-06 07:09:30,470 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -10 predicate places. [2022-12-06 07:09:30,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:30,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 0 transitions, 0 flow [2022-12-06 07:09:30,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 07:09:30,470 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 07:09:30,470 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:30,470 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-06 07:09:30,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 07:09:30,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 07:09:30,471 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:30,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 07:09:30,471 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 07:09:30,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:09:30,473 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-12-06 07:09:30,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 07:09:30,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-12-06 07:09:30,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-12-06 07:09:30,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-12-06 07:09:30,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-12-06 07:09:30,474 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 07:09:30,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:09:30,475 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:30,478 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:09:30,478 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:09:30,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:09:30 BasicIcfg [2022-12-06 07:09:30,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:09:30,480 INFO L158 Benchmark]: Toolchain (without parser) took 11936.74ms. Allocated memory was 209.7MB in the beginning and 377.5MB in the end (delta: 167.8MB). Free memory was 184.5MB in the beginning and 194.9MB in the end (delta: -10.3MB). Peak memory consumption was 158.9MB. Max. memory is 8.0GB. [2022-12-06 07:09:30,480 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory was 186.3MB in the beginning and 186.2MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:09:30,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.85ms. Allocated memory is still 209.7MB. Free memory was 184.5MB in the beginning and 164.5MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 07:09:30,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.52ms. Allocated memory is still 209.7MB. Free memory was 164.5MB in the beginning and 161.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:09:30,481 INFO L158 Benchmark]: Boogie Preprocessor took 31.77ms. Allocated memory is still 209.7MB. Free memory was 161.9MB in the beginning and 160.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:09:30,481 INFO L158 Benchmark]: RCFGBuilder took 428.86ms. Allocated memory is still 209.7MB. Free memory was 160.3MB in the beginning and 142.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 07:09:30,481 INFO L158 Benchmark]: TraceAbstraction took 11044.64ms. Allocated memory was 209.7MB in the beginning and 377.5MB in the end (delta: 167.8MB). Free memory was 142.0MB in the beginning and 194.9MB in the end (delta: -52.9MB). Peak memory consumption was 115.9MB. Max. memory is 8.0GB. [2022-12-06 07:09:30,482 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.11ms. Allocated memory is still 209.7MB. Free memory was 186.3MB in the beginning and 186.2MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 388.85ms. Allocated memory is still 209.7MB. Free memory was 184.5MB in the beginning and 164.5MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.52ms. Allocated memory is still 209.7MB. Free memory was 164.5MB in the beginning and 161.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.77ms. Allocated memory is still 209.7MB. Free memory was 161.9MB in the beginning and 160.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 428.86ms. Allocated memory is still 209.7MB. Free memory was 160.3MB in the beginning and 142.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11044.64ms. Allocated memory was 209.7MB in the beginning and 377.5MB in the end (delta: 167.8MB). Free memory was 142.0MB in the beginning and 194.9MB in the end (delta: -52.9MB). Peak memory consumption was 115.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 156 PlacesBefore, 37 PlacesAfterwards, 160 TransitionsBefore, 36 TransitionsAfterwards, 6570 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 84 ConcurrentYvCompositions, 6 ChoiceCompositions, 143 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6156, independent: 5897, independent conditional: 5897, independent unconditional: 0, dependent: 259, dependent conditional: 259, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6156, independent: 5897, independent conditional: 0, independent unconditional: 5897, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6156, independent: 5897, independent conditional: 0, independent unconditional: 5897, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6156, independent: 5897, independent conditional: 0, independent unconditional: 5897, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4545, independent: 4468, independent conditional: 0, independent unconditional: 4468, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4545, independent: 4336, independent conditional: 0, independent unconditional: 4336, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 209, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6156, independent: 1429, independent conditional: 0, independent unconditional: 1429, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 4545, unknown conditional: 0, unknown unconditional: 4545] , Statistics on independence cache: Total cache size (in pairs): 9733, Positive cache size: 9656, Positive conditional cache size: 0, Positive unconditional cache size: 9656, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 511, independent: 418, independent conditional: 418, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 511, independent: 418, independent conditional: 0, independent unconditional: 418, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 511, independent: 418, independent conditional: 0, independent unconditional: 418, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 511, independent: 418, independent conditional: 0, independent unconditional: 418, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 206, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 206, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 511, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 206, unknown conditional: 0, unknown unconditional: 206] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 39 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 36 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 416, independent: 326, independent conditional: 326, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 416, independent: 326, independent conditional: 50, independent unconditional: 276, dependent: 90, dependent conditional: 4, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 416, independent: 326, independent conditional: 47, independent unconditional: 279, dependent: 90, dependent conditional: 4, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 416, independent: 326, independent conditional: 47, independent unconditional: 279, dependent: 90, dependent conditional: 4, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 37, independent conditional: 4, independent unconditional: 33, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 416, independent: 289, independent conditional: 43, independent unconditional: 246, dependent: 81, dependent conditional: 3, dependent unconditional: 78, unknown: 46, unknown conditional: 5, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 254, Positive conditional cache size: 4, Positive unconditional cache size: 250, Negative cache size: 44, Negative conditional cache size: 1, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 48 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 384, independent: 288, independent conditional: 288, independent unconditional: 0, dependent: 96, dependent conditional: 96, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 384, independent: 288, independent conditional: 26, independent unconditional: 262, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 384, independent: 288, independent conditional: 26, independent unconditional: 262, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 384, independent: 288, independent conditional: 26, independent unconditional: 262, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 384, independent: 274, independent conditional: 26, independent unconditional: 248, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 278, Positive conditional cache size: 4, Positive unconditional cache size: 274, Negative cache size: 49, Negative conditional cache size: 1, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 39 PlacesAfterwards, 35 TransitionsBefore, 30 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, independent: 103, independent conditional: 103, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139, independent: 103, independent conditional: 18, independent unconditional: 85, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 103, independent conditional: 17, independent unconditional: 86, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 103, independent conditional: 17, independent unconditional: 86, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 89, independent conditional: 12, independent unconditional: 77, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 18, unknown conditional: 8, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 361, Positive conditional cache size: 9, Positive unconditional cache size: 352, Negative cache size: 53, Negative conditional cache size: 4, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 38 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 32 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 94, independent conditional: 94, 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: 112, independent: 94, independent conditional: 28, independent unconditional: 66, dependent: 18, dependent conditional: 14, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 94, independent conditional: 20, independent unconditional: 74, dependent: 22, dependent conditional: 14, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 94, independent conditional: 20, independent unconditional: 74, dependent: 22, dependent conditional: 14, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 2, dependent conditional: 1, 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: 2, independent conditional: 1, independent unconditional: 1, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 5, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 88, independent conditional: 17, independent unconditional: 71, dependent: 20, dependent conditional: 13, dependent unconditional: 7, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 369, Positive conditional cache size: 12, Positive unconditional cache size: 357, Negative cache size: 55, Negative conditional cache size: 5, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 116, independent conditional: 41, independent unconditional: 75, dependent: 22, dependent conditional: 16, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 116, independent conditional: 23, independent unconditional: 93, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 116, independent conditional: 23, independent unconditional: 93, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 109, independent conditional: 20, independent unconditional: 89, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 376, Positive conditional cache size: 15, Positive unconditional cache size: 361, Negative cache size: 55, Negative conditional cache size: 5, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 28, independent conditional: 4, independent unconditional: 24, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 28, independent conditional: 4, independent unconditional: 24, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 28, independent conditional: 4, independent unconditional: 24, dependent: 12, dependent conditional: 4, dependent unconditional: 8, 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: 40, independent: 28, independent conditional: 4, independent unconditional: 24, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 376, Positive conditional cache size: 15, Positive unconditional cache size: 361, Negative cache size: 55, Negative conditional cache size: 5, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 41 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 45, independent conditional: 32, independent unconditional: 13, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 45, independent conditional: 32, independent unconditional: 13, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 32, independent unconditional: 13, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 42, independent conditional: 29, independent unconditional: 13, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 444, Positive conditional cache size: 18, Positive unconditional cache size: 426, Negative cache size: 59, Negative conditional cache size: 7, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 38 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 20 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 466, Positive conditional cache size: 20, Positive unconditional cache size: 446, Negative cache size: 59, Negative conditional cache size: 7, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, 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: 8, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 468, Positive conditional cache size: 20, Positive unconditional cache size: 448, Negative cache size: 60, Negative conditional cache size: 7, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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): 528, Positive cache size: 468, Positive conditional cache size: 20, Positive unconditional cache size: 448, Negative cache size: 60, Negative conditional cache size: 7, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 223 locations, 7 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: 10.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 7 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=3, InterpolantAutomatonStates: 49, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 07:09:30,500 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...