/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:59:19,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:59:19,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:59:19,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:59:19,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:59:19,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:59:19,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:59:19,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:59:19,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:59:19,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:59:19,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:59:19,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:59:19,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:59:19,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:59:19,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:59:19,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:59:19,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:59:19,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:59:19,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:59:19,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:59:19,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:59:19,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:59:19,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:59:19,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:59:19,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:59:19,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:59:19,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:59:19,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:59:19,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:59:19,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:59:19,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:59:19,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:59:19,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:59:19,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:59:19,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:59:19,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:59:19,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:59:19,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:59:19,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:59:19,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:59:19,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:59:19,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:59:19,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:59:19,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:59:19,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:59:19,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:59:19,571 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:59:19,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:59:19,572 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:59:19,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:59:19,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:59:19,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:59:19,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:59:19,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:59:19,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:59:19,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:59:19,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:59:19,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:59:19,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:59:19,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:59:19,574 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:59:19,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:59:19,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:59:19,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:59:19,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:59:19,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:59:19,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:59:19,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:59:19,833 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:59:19,834 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:59:19,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2022-12-13 09:59:20,738 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:59:20,991 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:59:20,992 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2022-12-13 09:59:21,054 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8042c04/ae0531203fd24677bc9b759d86245887/FLAG3c62d3b68 [2022-12-13 09:59:21,072 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8042c04/ae0531203fd24677bc9b759d86245887 [2022-12-13 09:59:21,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:59:21,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:59:21,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:59:21,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:59:21,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:59:21,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2029cee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21, skipping insertion in model container [2022-12-13 09:59:21,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:59:21,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:59:21,250 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/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2022-12-13 09:59:21,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:59:21,365 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:59:21,375 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/13-privatized_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2022-12-13 09:59:21,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:59:21,425 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:59:21,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21 WrapperNode [2022-12-13 09:59:21,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:59:21,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:59:21,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:59:21,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:59:21,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,457 INFO L138 Inliner]: procedures = 162, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2022-12-13 09:59:21,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:59:21,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:59:21,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:59:21,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:59:21,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,470 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:59:21,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:59:21,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:59:21,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:59:21,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (1/1) ... [2022-12-13 09:59:21,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:59:21,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:59:21,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:59:21,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:59:21,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:59:21,530 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 09:59:21,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:59:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:59:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 09:59:21,531 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 09:59:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:59:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:59:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:59:21,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:59:21,532 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:59:21,649 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:59:21,650 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:59:21,786 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:59:21,799 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:59:21,800 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:59:21,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:59:21 BoogieIcfgContainer [2022-12-13 09:59:21,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:59:21,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:59:21,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:59:21,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:59:21,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:59:21" (1/3) ... [2022-12-13 09:59:21,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393803a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:59:21, skipping insertion in model container [2022-12-13 09:59:21,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:59:21" (2/3) ... [2022-12-13 09:59:21,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393803a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:59:21, skipping insertion in model container [2022-12-13 09:59:21,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:59:21" (3/3) ... [2022-12-13 09:59:21,809 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_41-traces-ex-7_unknown_1_pos.i [2022-12-13 09:59:21,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:59:21,822 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:59:21,823 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:59:21,880 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:59:21,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 125 flow [2022-12-13 09:59:21,949 INFO L130 PetriNetUnfolder]: 1/59 cut-off events. [2022-12-13 09:59:21,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:21,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 59 events. 1/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2022-12-13 09:59:21,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 125 flow [2022-12-13 09:59:21,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 51 transitions, 105 flow [2022-12-13 09:59:21,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:21,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 105 flow [2022-12-13 09:59:21,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 105 flow [2022-12-13 09:59:22,003 INFO L130 PetriNetUnfolder]: 0/51 cut-off events. [2022-12-13 09:59:22,006 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:22,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 51 events. 0/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 19 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 09:59:22,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 105 flow [2022-12-13 09:59:22,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 09:59:24,081 INFO L241 LiptonReduction]: Total number of compositions: 43 [2022-12-13 09:59:24,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:59:24,095 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;@59ae3309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:59:24,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 09:59:24,098 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 09:59:24,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:24,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:24,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 09:59:24,099 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1847464291, now seen corresponding path program 1 times [2022-12-13 09:59:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:24,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438729264] [2022-12-13 09:59:24,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:59:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:59:24,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:59:24,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438729264] [2022-12-13 09:59:24,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438729264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:59:24,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:59:24,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:59:24,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929136269] [2022-12-13 09:59:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:59:24,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:59:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:59:24,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:59:24,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:59:24,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 16 [2022-12-13 09:59:24,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 35 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:24,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:59:24,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 16 [2022-12-13 09:59:24,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:59:24,437 INFO L130 PetriNetUnfolder]: 23/68 cut-off events. [2022-12-13 09:59:24,437 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:24,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 68 events. 23/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 222 event pairs, 14 based on Foata normal form. 5/56 useless extension candidates. Maximal degree in co-relation 123. Up to 33 conditions per place. [2022-12-13 09:59:24,439 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 11 selfloop transitions, 2 changer transitions 4/19 dead transitions. [2022-12-13 09:59:24,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 19 transitions, 73 flow [2022-12-13 09:59:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:59:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:59:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-13 09:59:24,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-13 09:59:24,448 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 35 flow. Second operand 3 states and 26 transitions. [2022-12-13 09:59:24,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 19 transitions, 73 flow [2022-12-13 09:59:24,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:59:24,451 INFO L231 Difference]: Finished difference. Result has 22 places, 12 transitions, 34 flow [2022-12-13 09:59:24,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=34, PETRI_PLACES=22, PETRI_TRANSITIONS=12} [2022-12-13 09:59:24,454 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-13 09:59:24,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:59:24,455 INFO L89 Accepts]: Start accepts. Operand has 22 places, 12 transitions, 34 flow [2022-12-13 09:59:24,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:59:24,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:24,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 12 transitions, 34 flow [2022-12-13 09:59:24,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 12 transitions, 34 flow [2022-12-13 09:59:24,460 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 09:59:24,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:59:24,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 12 events. 0/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 14 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:59:24,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 12 transitions, 34 flow [2022-12-13 09:59:24,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-13 09:59:24,488 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:59:24,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 09:59:24,490 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 12 transitions, 34 flow [2022-12-13 09:59:24,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:24,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:24,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:59:24,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:59:24,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1304410006, now seen corresponding path program 1 times [2022-12-13 09:59:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:24,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933636141] [2022-12-13 09:59:24,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:59:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:59:24,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:59:24,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933636141] [2022-12-13 09:59:24,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933636141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:59:24,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:59:24,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:59:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034853707] [2022-12-13 09:59:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:59:24,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:59:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:59:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:59:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:59:24,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-13 09:59:24,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 12 transitions, 34 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:24,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:59:24,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-13 09:59:24,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:59:24,587 INFO L130 PetriNetUnfolder]: 14/50 cut-off events. [2022-12-13 09:59:24,588 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:59:24,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 50 events. 14/50 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 154 event pairs, 4 based on Foata normal form. 4/44 useless extension candidates. Maximal degree in co-relation 105. Up to 36 conditions per place. [2022-12-13 09:59:24,588 INFO L137 encePairwiseOnDemand]: 5/12 looper letters, 11 selfloop transitions, 7 changer transitions 0/18 dead transitions. [2022-12-13 09:59:24,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 84 flow [2022-12-13 09:59:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:59:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:59:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-13 09:59:24,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 09:59:24,589 INFO L175 Difference]: Start difference. First operand has 18 places, 12 transitions, 34 flow. Second operand 3 states and 20 transitions. [2022-12-13 09:59:24,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 84 flow [2022-12-13 09:59:24,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 18 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:59:24,590 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 67 flow [2022-12-13 09:59:24,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-13 09:59:24,591 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-13 09:59:24,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:59:24,591 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 67 flow [2022-12-13 09:59:24,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:59:24,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:24,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 67 flow [2022-12-13 09:59:24,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 67 flow [2022-12-13 09:59:24,595 INFO L130 PetriNetUnfolder]: 7/37 cut-off events. [2022-12-13 09:59:24,595 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 09:59:24,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 37 events. 7/37 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 4 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 75. Up to 20 conditions per place. [2022-12-13 09:59:24,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 67 flow [2022-12-13 09:59:24,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 09:59:24,624 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 09:59:24,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [153] L694-3-->L695-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_70| |v_~#D~0.base_31|))) (and (= |v_#pthreadsMutex_69| (store |v_#pthreadsMutex_70| |v_~#D~0.base_31| (store .cse0 |v_~#D~0.offset_31| 1))) (= (select .cse0 |v_~#D~0.offset_31|) 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_70|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_69|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_9|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_14|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~pre3#1] and [132] L689-->L690: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#D~0.base_10| (store (select |v_#pthreadsMutex_14| |v_~#D~0.base_10|) |v_~#D~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#D~0.base=|v_~#D~0.base_10|, ~#D~0.offset=|v_~#D~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#D~0.base=|v_~#D~0.base_10|, ~#D~0.offset=|v_~#D~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex] [2022-12-13 09:59:24,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [153] L694-3-->L695-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_70| |v_~#D~0.base_31|))) (and (= |v_#pthreadsMutex_69| (store |v_#pthreadsMutex_70| |v_~#D~0.base_31| (store .cse0 |v_~#D~0.offset_31| 1))) (= (select .cse0 |v_~#D~0.offset_31|) 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_70|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_69|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_9|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_14|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~pre3#1] and [165] L689-->t_funFINAL: Formula: (and (= |v_t_funThread1of1ForFork0_#res.offset_7| 0) (= |v_t_funThread1of1ForFork0_#res.base_7| 0) (= (store |v_#pthreadsMutex_118| |v_~#D~0.base_51| (store (select |v_#pthreadsMutex_118| |v_~#D~0.base_51|) |v_~#D~0.offset_51| 0)) |v_#pthreadsMutex_117|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_118|, ~#D~0.base=|v_~#D~0.base_51|, ~#D~0.offset=|v_~#D~0.offset_51|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_117|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_7|, ~#D~0.base=|v_~#D~0.base_51|, ~#D~0.offset=|v_~#D~0.offset_51|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 09:59:24,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [153] L694-3-->L695-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_70| |v_~#D~0.base_31|))) (and (= |v_#pthreadsMutex_69| (store |v_#pthreadsMutex_70| |v_~#D~0.base_31| (store .cse0 |v_~#D~0.offset_31| 1))) (= (select .cse0 |v_~#D~0.offset_31|) 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_70|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_69|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_9|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_14|, ~#D~0.base=|v_~#D~0.base_31|, ~#D~0.offset=|v_~#D~0.offset_31|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~pre3#1] and [166] L689-->t_funEXIT: Formula: (and (= (store |v_#pthreadsMutex_122| |v_~#D~0.base_53| (store (select |v_#pthreadsMutex_122| |v_~#D~0.base_53|) |v_~#D~0.offset_53| 0)) |v_#pthreadsMutex_121|) (= |v_t_funThread1of1ForFork0_#res.offset_9| 0) (= |v_t_funThread1of1ForFork0_#res.base_9| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, ~#D~0.base=|v_~#D~0.base_53|, ~#D~0.offset=|v_~#D~0.offset_53|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_121|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_9|, ~#D~0.base=|v_~#D~0.base_53|, ~#D~0.offset=|v_~#D~0.offset_53|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#res.offset] [2022-12-13 09:59:24,841 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 09:59:24,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [182] $Ultimate##0-->L689: Formula: (let ((.cse2 (select |v_#pthreadsMutex_410| |v_~#D~0.base_135|))) (let ((.cse0 (store |v_#pthreadsMutex_410| |v_~#D~0.base_135| (store .cse2 |v_~#D~0.offset_135| 1)))) (let ((.cse1 (select .cse0 |v_~#A~0.base_135|))) (and (= v_t_funThread1of1ForFork0_~arg.base_27 |v_t_funThread1of1ForFork0_#in~arg.base_27|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_27| v_t_funThread1of1ForFork0_~arg.offset_27) (= |v_#pthreadsMutex_408| (store .cse0 |v_~#A~0.base_135| (store .cse1 |v_~#A~0.offset_135| 0))) (= (select .cse2 |v_~#D~0.offset_135|) 0) (= v_~g~0_80 17) (= (select .cse1 |v_~#A~0.offset_135|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_410|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_135|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, ~#A~0.base=|v_~#A~0.base_135|, ~#D~0.base=|v_~#D~0.base_135|, ~#D~0.offset=|v_~#D~0.offset_135|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_408|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_135|, ~g~0=v_~g~0_80, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_27, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_93|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_87|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_27, ~#A~0.base=|v_~#A~0.base_135|, ~#D~0.base=|v_~#D~0.base_135|, ~#D~0.offset=|v_~#D~0.offset_135|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] and [187] L694-3-->L690: Formula: (let ((.cse0 (select |v_#pthreadsMutex_465| |v_~#D~0.base_157|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_127| 0) (= (select .cse0 |v_~#D~0.offset_157|) 0) (= |v_#pthreadsMutex_463| (store |v_#pthreadsMutex_465| |v_~#D~0.base_157| (store .cse0 |v_~#D~0.offset_157| 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_465|, ~#D~0.base=|v_~#D~0.base_157|, ~#D~0.offset=|v_~#D~0.offset_157|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_463|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_64|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_127|, ~#D~0.base=|v_~#D~0.base_157|, ~#D~0.offset=|v_~#D~0.offset_157|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_74|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~pre3#1] [2022-12-13 09:59:24,848 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [182] $Ultimate##0-->L689: Formula: (let ((.cse2 (select |v_#pthreadsMutex_410| |v_~#D~0.base_135|))) (let ((.cse0 (store |v_#pthreadsMutex_410| |v_~#D~0.base_135| (store .cse2 |v_~#D~0.offset_135| 1)))) (let ((.cse1 (select .cse0 |v_~#A~0.base_135|))) (and (= v_t_funThread1of1ForFork0_~arg.base_27 |v_t_funThread1of1ForFork0_#in~arg.base_27|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_27| v_t_funThread1of1ForFork0_~arg.offset_27) (= |v_#pthreadsMutex_408| (store .cse0 |v_~#A~0.base_135| (store .cse1 |v_~#A~0.offset_135| 0))) (= (select .cse2 |v_~#D~0.offset_135|) 0) (= v_~g~0_80 17) (= (select .cse1 |v_~#A~0.offset_135|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_410|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_135|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, ~#A~0.base=|v_~#A~0.base_135|, ~#D~0.base=|v_~#D~0.base_135|, ~#D~0.offset=|v_~#D~0.offset_135|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_408|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_135|, ~g~0=v_~g~0_80, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_27, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_93|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_87|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_27, ~#A~0.base=|v_~#A~0.base_135|, ~#D~0.base=|v_~#D~0.base_135|, ~#D~0.offset=|v_~#D~0.offset_135|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] and [188] L694-3-->t_funFINAL: Formula: (let ((.cse0 (select |v_#pthreadsMutex_471| |v_~#D~0.base_159|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_129| 0) (= (store |v_#pthreadsMutex_471| |v_~#D~0.base_159| (store .cse0 |v_~#D~0.offset_159| 0)) |v_#pthreadsMutex_469|) (= |v_t_funThread1of1ForFork0_#res.offset_25| 0) (= |v_t_funThread1of1ForFork0_#res.base_25| 0) (= (select .cse0 |v_~#D~0.offset_159|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_471|, ~#D~0.base=|v_~#D~0.base_159|, ~#D~0.offset=|v_~#D~0.offset_159|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_469|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_66|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_129|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_25|, ~#D~0.base=|v_~#D~0.base_159|, ~#D~0.offset=|v_~#D~0.offset_159|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_76|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~pre3#1, t_funThread1of1ForFork0_#res.offset] [2022-12-13 09:59:24,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [182] $Ultimate##0-->L689: Formula: (let ((.cse2 (select |v_#pthreadsMutex_410| |v_~#D~0.base_135|))) (let ((.cse0 (store |v_#pthreadsMutex_410| |v_~#D~0.base_135| (store .cse2 |v_~#D~0.offset_135| 1)))) (let ((.cse1 (select .cse0 |v_~#A~0.base_135|))) (and (= v_t_funThread1of1ForFork0_~arg.base_27 |v_t_funThread1of1ForFork0_#in~arg.base_27|) (= |v_t_funThread1of1ForFork0_#in~arg.offset_27| v_t_funThread1of1ForFork0_~arg.offset_27) (= |v_#pthreadsMutex_408| (store .cse0 |v_~#A~0.base_135| (store .cse1 |v_~#A~0.offset_135| 0))) (= (select .cse2 |v_~#D~0.offset_135|) 0) (= v_~g~0_80 17) (= (select .cse1 |v_~#A~0.offset_135|) 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_410|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_135|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, ~#A~0.base=|v_~#A~0.base_135|, ~#D~0.base=|v_~#D~0.base_135|, ~#D~0.offset=|v_~#D~0.offset_135|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_408|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_27|, ~#A~0.offset=|v_~#A~0.offset_135|, ~g~0=v_~g~0_80, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_27, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_93|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_87|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_27|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_27, ~#A~0.base=|v_~#A~0.base_135|, ~#D~0.base=|v_~#D~0.base_135|, ~#D~0.offset=|v_~#D~0.offset_135|} AuxVars[] AssignedVars[#pthreadsMutex, ~g~0, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base] and [189] L694-3-->t_funEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_477| |v_~#D~0.base_161|))) (and (= (select .cse0 |v_~#D~0.offset_161|) 0) (= |v_t_funThread1of1ForFork0_#res.base_27| 0) (= |v_ULTIMATE.start_main_#t~nondet5#1_131| 0) (= |v_t_funThread1of1ForFork0_#res.offset_27| 0) (= |v_#pthreadsMutex_475| (store |v_#pthreadsMutex_477| |v_~#D~0.base_161| (store .cse0 |v_~#D~0.offset_161| 0))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_477|, ~#D~0.base=|v_~#D~0.base_161|, ~#D~0.offset=|v_~#D~0.offset_161|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_475|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_68|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_131|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_27|, ~#D~0.base=|v_~#D~0.base_161|, ~#D~0.offset=|v_~#D~0.offset_161|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_78|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_27|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_#res.base, ULTIMATE.start_main_#t~pre3#1, t_funThread1of1ForFork0_#res.offset] [2022-12-13 09:59:24,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [190] $Ultimate##0-->L690: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_481|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_70|, ~g~0=v_~g~0_84, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_29, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_133|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_29, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_97|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_89|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_80|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ~g~0, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~pre3#1] and [185] L695-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (select |v_#pthreadsMutex_454| |v_~#A~0.base_150|))) (and (= |v_#pthreadsMutex_453| (let ((.cse0 (store |v_#pthreadsMutex_454| |v_~#A~0.base_150| (store .cse1 |v_~#A~0.offset_150| 1)))) (store .cse0 |v_~#D~0.base_153| (store (select .cse0 |v_~#D~0.base_153|) |v_~#D~0.offset_153| 0)))) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25| 0) (= (select .cse1 |v_~#A~0.offset_150|) 0) (= (ite (= v_~g~0_82 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_454|, ~#A~0.offset=|v_~#A~0.offset_150|, ~g~0=v_~g~0_82, ~#D~0.base=|v_~#D~0.base_153|, ~#A~0.base=|v_~#A~0.base_150|, ~#D~0.offset=|v_~#D~0.offset_153|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_453|, ~#A~0.offset=|v_~#A~0.offset_150|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ~g~0=v_~g~0_82, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_121|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_101|, ~#D~0.base=|v_~#D~0.base_153|, ~#A~0.base=|v_~#A~0.base_150|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|, ~#D~0.offset=|v_~#D~0.offset_153|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 09:59:24,871 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [191] $Ultimate##0-->t_funFINAL: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_487|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_72|, ~g~0=v_~g~0_86, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_31, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_29|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_135|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_31, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_99|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_29|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_91|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_82|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ~g~0, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~pre3#1, t_funThread1of1ForFork0_#res.offset] and [185] L695-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (select |v_#pthreadsMutex_454| |v_~#A~0.base_150|))) (and (= |v_#pthreadsMutex_453| (let ((.cse0 (store |v_#pthreadsMutex_454| |v_~#A~0.base_150| (store .cse1 |v_~#A~0.offset_150| 1)))) (store .cse0 |v_~#D~0.base_153| (store (select .cse0 |v_~#D~0.base_153|) |v_~#D~0.offset_153| 0)))) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25| 0) (= (select .cse1 |v_~#A~0.offset_150|) 0) (= (ite (= v_~g~0_82 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_454|, ~#A~0.offset=|v_~#A~0.offset_150|, ~g~0=v_~g~0_82, ~#D~0.base=|v_~#D~0.base_153|, ~#A~0.base=|v_~#A~0.base_150|, ~#D~0.offset=|v_~#D~0.offset_153|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_453|, ~#A~0.offset=|v_~#A~0.offset_150|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ~g~0=v_~g~0_82, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_121|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_101|, ~#D~0.base=|v_~#D~0.base_153|, ~#A~0.base=|v_~#A~0.base_150|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|, ~#D~0.offset=|v_~#D~0.offset_153|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 09:59:24,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [192] $Ultimate##0-->t_funEXIT: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_493|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_74|, ~g~0=v_~g~0_88, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_33, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_31|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_137|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_33, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_101|, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_31|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_93|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_84|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet4#1, ~g~0, ULTIMATE.start_main_#t~nondet5#1, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~pre3#1, t_funThread1of1ForFork0_#res.offset] and [185] L695-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (select |v_#pthreadsMutex_454| |v_~#A~0.base_150|))) (and (= |v_#pthreadsMutex_453| (let ((.cse0 (store |v_#pthreadsMutex_454| |v_~#A~0.base_150| (store .cse1 |v_~#A~0.offset_150| 1)))) (store .cse0 |v_~#D~0.base_153| (store (select .cse0 |v_~#D~0.base_153|) |v_~#D~0.offset_153| 0)))) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25| 0) (= (select .cse1 |v_~#A~0.offset_150|) 0) (= (ite (= v_~g~0_82 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_454|, ~#A~0.offset=|v_~#A~0.offset_150|, ~g~0=v_~g~0_82, ~#D~0.base=|v_~#D~0.base_153|, ~#A~0.base=|v_~#A~0.base_150|, ~#D~0.offset=|v_~#D~0.offset_153|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_453|, ~#A~0.offset=|v_~#A~0.offset_150|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_27|, ~g~0=v_~g~0_82, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_121|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_101|, ~#D~0.base=|v_~#D~0.base_153|, ~#A~0.base=|v_~#A~0.base_150|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_25|, ~#D~0.offset=|v_~#D~0.offset_153|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-13 09:59:24,882 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 09:59:24,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-13 09:59:24,883 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 11 transitions, 63 flow [2022-12-13 09:59:24,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:24,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:24,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:59:24,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:59:24,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1437670159, now seen corresponding path program 1 times [2022-12-13 09:59:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749940195] [2022-12-13 09:59:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:59:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:59:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:59:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749940195] [2022-12-13 09:59:25,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749940195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:59:25,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:59:25,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:59:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407833664] [2022-12-13 09:59:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:59:25,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:59:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:59:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:59:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:59:25,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-13 09:59:25,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 11 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:25,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:59:25,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-13 09:59:25,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:59:25,061 INFO L130 PetriNetUnfolder]: 6/21 cut-off events. [2022-12-13 09:59:25,062 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 09:59:25,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 21 events. 6/21 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 44 event pairs, 0 based on Foata normal form. 2/17 useless extension candidates. Maximal degree in co-relation 64. Up to 16 conditions per place. [2022-12-13 09:59:25,062 INFO L137 encePairwiseOnDemand]: 5/11 looper letters, 9 selfloop transitions, 2 changer transitions 0/11 dead transitions. [2022-12-13 09:59:25,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 11 transitions, 70 flow [2022-12-13 09:59:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:59:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:59:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-12-13 09:59:25,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-13 09:59:25,064 INFO L175 Difference]: Start difference. First operand has 14 places, 11 transitions, 63 flow. Second operand 4 states and 15 transitions. [2022-12-13 09:59:25,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 11 transitions, 70 flow [2022-12-13 09:59:25,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 66 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 09:59:25,065 INFO L231 Difference]: Finished difference. Result has 17 places, 8 transitions, 39 flow [2022-12-13 09:59:25,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=39, PETRI_PLACES=17, PETRI_TRANSITIONS=8} [2022-12-13 09:59:25,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -3 predicate places. [2022-12-13 09:59:25,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:59:25,066 INFO L89 Accepts]: Start accepts. Operand has 17 places, 8 transitions, 39 flow [2022-12-13 09:59:25,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:59:25,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:25,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 8 transitions, 39 flow [2022-12-13 09:59:25,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 8 transitions, 39 flow [2022-12-13 09:59:25,070 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-13 09:59:25,070 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 09:59:25,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 15 events. 3/15 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 26 event pairs, 3 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 33. Up to 13 conditions per place. [2022-12-13 09:59:25,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 8 transitions, 39 flow [2022-12-13 09:59:25,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 09:59:25,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:59:25,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 09:59:25,114 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 7 transitions, 37 flow [2022-12-13 09:59:25,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:25,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:25,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 09:59:25,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:59:25,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 6392644, now seen corresponding path program 1 times [2022-12-13 09:59:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:25,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343380523] [2022-12-13 09:59:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:59:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:59:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:59:25,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343380523] [2022-12-13 09:59:25,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343380523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:59:25,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:59:25,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:59:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932214940] [2022-12-13 09:59:25,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:59:25,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:59:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:59:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:59:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:59:25,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 7 [2022-12-13 09:59:25,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 7 transitions, 37 flow. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:25,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:59:25,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 7 [2022-12-13 09:59:25,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:59:25,230 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 09:59:25,230 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 09:59:25,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 9 events. 0/9 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 1/8 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-13 09:59:25,230 INFO L137 encePairwiseOnDemand]: 1/7 looper letters, 2 selfloop transitions, 5 changer transitions 0/7 dead transitions. [2022-12-13 09:59:25,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 7 transitions, 51 flow [2022-12-13 09:59:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:59:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:59:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-12-13 09:59:25,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-13 09:59:25,232 INFO L175 Difference]: Start difference. First operand has 16 places, 7 transitions, 37 flow. Second operand 4 states and 8 transitions. [2022-12-13 09:59:25,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 7 transitions, 51 flow [2022-12-13 09:59:25,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 7 transitions, 38 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 09:59:25,233 INFO L231 Difference]: Finished difference. Result has 18 places, 7 transitions, 40 flow [2022-12-13 09:59:25,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=7, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=40, PETRI_PLACES=18, PETRI_TRANSITIONS=7} [2022-12-13 09:59:25,235 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -2 predicate places. [2022-12-13 09:59:25,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:59:25,235 INFO L89 Accepts]: Start accepts. Operand has 18 places, 7 transitions, 40 flow [2022-12-13 09:59:25,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:59:25,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:59:25,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 7 transitions, 40 flow [2022-12-13 09:59:25,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 7 transitions, 40 flow [2022-12-13 09:59:25,237 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 09:59:25,237 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 09:59:25,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 9 events. 0/9 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/7 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-12-13 09:59:25,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 7 transitions, 40 flow [2022-12-13 09:59:25,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:59:25,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:59:25,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 09:59:25,403 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 6 transitions, 40 flow [2022-12-13 09:59:25,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:59:25,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:59:25,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 09:59:25,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:59:25,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:59:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:59:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash 6393109, now seen corresponding path program 1 times [2022-12-13 09:59:25,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:59:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824466469] [2022-12-13 09:59:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:59:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:59:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:59:25,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:59:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:59:25,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:59:25,434 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:59:25,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 09:59:25,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2022-12-13 09:59:25,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:59:25,436 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-13 09:59:25,439 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:59:25,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:59:25,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:59:25 BasicIcfg [2022-12-13 09:59:25,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:59:25,452 INFO L158 Benchmark]: Toolchain (without parser) took 4376.23ms. Allocated memory was 207.6MB in the beginning and 267.4MB in the end (delta: 59.8MB). Free memory was 182.3MB in the beginning and 221.5MB in the end (delta: -39.2MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. [2022-12-13 09:59:25,452 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory was 184.6MB in the beginning and 184.5MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:59:25,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.12ms. Allocated memory is still 207.6MB. Free memory was 182.3MB in the beginning and 163.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 09:59:25,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.51ms. Allocated memory is still 207.6MB. Free memory was 163.4MB in the beginning and 161.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:59:25,453 INFO L158 Benchmark]: Boogie Preprocessor took 13.42ms. Allocated memory is still 207.6MB. Free memory was 161.4MB in the beginning and 159.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:59:25,453 INFO L158 Benchmark]: RCFGBuilder took 330.26ms. Allocated memory is still 207.6MB. Free memory was 159.8MB in the beginning and 147.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 09:59:25,453 INFO L158 Benchmark]: TraceAbstraction took 3647.18ms. Allocated memory was 207.6MB in the beginning and 267.4MB in the end (delta: 59.8MB). Free memory was 146.1MB in the beginning and 221.5MB in the end (delta: -75.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:59:25,454 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory was 184.6MB in the beginning and 184.5MB in the end (delta: 149.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 347.12ms. Allocated memory is still 207.6MB. Free memory was 182.3MB in the beginning and 163.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.51ms. Allocated memory is still 207.6MB. Free memory was 163.4MB in the beginning and 161.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.42ms. Allocated memory is still 207.6MB. Free memory was 161.4MB in the beginning and 159.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 330.26ms. Allocated memory is still 207.6MB. Free memory was 159.8MB in the beginning and 147.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3647.18ms. Allocated memory was 207.6MB in the beginning and 267.4MB in the end (delta: 59.8MB). Free memory was 146.1MB in the beginning and 221.5MB in the end (delta: -75.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 55 PlacesBefore, 20 PlacesAfterwards, 51 TransitionsBefore, 16 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 14 ConcurrentYvCompositions, 0 ChoiceCompositions, 43 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 299, independent: 238, independent conditional: 238, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 206, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 206, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 206, unknown conditional: 206, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 180, Positive conditional cache size: 180, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 18 PlacesBefore, 18 PlacesAfterwards, 12 TransitionsBefore, 12 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 7, Positive conditional cache size: 7, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 19 PlacesBefore, 14 PlacesAfterwards, 16 TransitionsBefore, 11 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 17 PlacesBefore, 16 PlacesAfterwards, 8 TransitionsBefore, 7 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 18 PlacesBefore, 16 PlacesAfterwards, 7 TransitionsBefore, 6 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 25, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L681] 0 int g = 0; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L693] 0 pthread_t id; [L694] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, arg={0:0}, D={4:0}, g=0, id={5:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L687] 1 g = 17 [L698] CALL 0 __VERIFIER_assert(g == 0) [L19] COND TRUE 0 !(cond) [L19] 0 reach_error() VAL [\old(cond)=0, A={3:0}, arg={0:0}, arg={0:0}, cond=0, D={4:0}, g=17] - UnprovableResult [Line: 694]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 72 locations, 2 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: 3.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 14, 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.4s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:59:25,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...