/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 01:26:40,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 01:26:40,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 01:26:40,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 01:26:40,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 01:26:40,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 01:26:40,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 01:26:40,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 01:26:40,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 01:26:40,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 01:26:40,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 01:26:40,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 01:26:40,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 01:26:40,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 01:26:40,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 01:26:40,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 01:26:40,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 01:26:40,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 01:26:40,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 01:26:40,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 01:26:40,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 01:26:40,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 01:26:40,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 01:26:40,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 01:26:40,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 01:26:40,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 01:26:40,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 01:26:40,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 01:26:40,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 01:26:40,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 01:26:40,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 01:26:40,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 01:26:40,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 01:26:40,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 01:26:40,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 01:26:40,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 01:26:40,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 01:26:40,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 01:26:40,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 01:26:40,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 01:26:40,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 01:26:40,439 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-VariableLbe.epf [2023-01-28 01:26:40,465 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 01:26:40,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 01:26:40,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 01:26:40,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 01:26:40,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 01:26:40,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 01:26:40,467 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 01:26:40,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 01:26:40,468 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 01:26:40,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 01:26:40,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 01:26:40,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 01:26:40,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 01:26:40,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 01:26:40,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 01:26:40,469 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 01:26:40,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 01:26:40,469 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 01:26:40,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 01:26:40,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 01:26:40,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 01:26:40,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 01:26:40,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 01:26:40,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 01:26:40,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 01:26:40,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 01:26:40,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 01:26:40,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 01:26:40,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 01:26:40,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 01:26:40,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 01:26:40,472 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 01:26:40,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 01:26:40,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 01:26:40,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 01:26:40,712 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 01:26:40,713 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 01:26:40,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2023-01-28 01:26:41,865 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 01:26:42,084 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 01:26:42,084 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_04-priv_multi_true.i [2023-01-28 01:26:42,107 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffd3dc4a/75d0dffc1dcb43d098a0bf2d2dda419f/FLAGaa3c8fdc9 [2023-01-28 01:26:42,121 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffd3dc4a/75d0dffc1dcb43d098a0bf2d2dda419f [2023-01-28 01:26:42,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 01:26:42,125 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 01:26:42,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 01:26:42,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 01:26:42,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 01:26:42,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c41d9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42, skipping insertion in model container [2023-01-28 01:26:42,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 01:26:42,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 01:26:42,352 WARN L247 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_04-priv_multi_true.i[1087,1100] [2023-01-28 01:26:42,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 01:26:42,629 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 01:26:42,639 WARN L247 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_04-priv_multi_true.i[1087,1100] [2023-01-28 01:26:42,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 01:26:42,736 WARN L667 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 01:26:42,741 INFO L208 MainTranslator]: Completed translation [2023-01-28 01:26:42,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42 WrapperNode [2023-01-28 01:26:42,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 01:26:42,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 01:26:42,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 01:26:42,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 01:26:42,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,781 INFO L138 Inliner]: procedures = 271, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2023-01-28 01:26:42,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 01:26:42,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 01:26:42,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 01:26:42,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 01:26:42,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 01:26:42,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 01:26:42,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 01:26:42,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 01:26:42,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (1/1) ... [2023-01-28 01:26:42,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 01:26:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 01:26:42,853 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) [2023-01-28 01:26:42,861 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 [2023-01-28 01:26:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-01-28 01:26:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 01:26:42,887 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2023-01-28 01:26:42,887 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2023-01-28 01:26:42,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 01:26:42,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 01:26:42,887 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 01:26:42,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 01:26:42,887 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2023-01-28 01:26:42,887 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2023-01-28 01:26:42,888 INFO L130 BoogieDeclarations]: Found specification of procedure process [2023-01-28 01:26:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2023-01-28 01:26:42,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 01:26:42,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 01:26:42,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 01:26:42,889 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 01:26:43,203 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 01:26:43,205 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 01:26:43,341 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 01:26:43,347 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 01:26:43,347 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 01:26:43,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:26:43 BoogieIcfgContainer [2023-01-28 01:26:43,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 01:26:43,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 01:26:43,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 01:26:43,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 01:26:43,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 01:26:42" (1/3) ... [2023-01-28 01:26:43,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7de33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:26:43, skipping insertion in model container [2023-01-28 01:26:43,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:26:42" (2/3) ... [2023-01-28 01:26:43,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7de33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:26:43, skipping insertion in model container [2023-01-28 01:26:43,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:26:43" (3/3) ... [2023-01-28 01:26:43,355 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2023-01-28 01:26:43,368 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 01:26:43,368 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 01:26:43,369 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 01:26:43,416 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 01:26:43,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 152 transitions, 319 flow [2023-01-28 01:26:43,508 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2023-01-28 01:26:43,508 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 01:26:43,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 12/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 313 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-01-28 01:26:43,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 152 transitions, 319 flow [2023-01-28 01:26:43,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 307 flow [2023-01-28 01:26:43,520 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 01:26:43,527 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 307 flow [2023-01-28 01:26:43,529 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 307 flow [2023-01-28 01:26:43,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 307 flow [2023-01-28 01:26:43,557 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2023-01-28 01:26:43,557 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 01:26:43,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 149 events. 12/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 314 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-01-28 01:26:43,562 INFO L119 LiptonReduction]: Number of co-enabled transitions 8738 [2023-01-28 01:26:47,269 INFO L134 LiptonReduction]: Checked pairs total: 18789 [2023-01-28 01:26:47,269 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-01-28 01:26:47,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 01:26:47,286 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=PETRI_NET, 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;@105c6229, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 01:26:47,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 01:26:47,293 INFO L130 PetriNetUnfolder]: 5/36 cut-off events. [2023-01-28 01:26:47,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 01:26:47,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:26:47,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:26:47,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:26:47,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:26:47,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1310239114, now seen corresponding path program 1 times [2023-01-28 01:26:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:26:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171035922] [2023-01-28 01:26:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:26:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:26:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:26:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:26:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:26:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171035922] [2023-01-28 01:26:47,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171035922] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:26:47,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:26:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 01:26:47,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455118117] [2023-01-28 01:26:47,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:26:47,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 01:26:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:26:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 01:26:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 01:26:47,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 273 [2023-01-28 01:26:47,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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) [2023-01-28 01:26:47,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:26:47,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 273 [2023-01-28 01:26:47,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:26:49,935 INFO L130 PetriNetUnfolder]: 25296/33989 cut-off events. [2023-01-28 01:26:49,935 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-01-28 01:26:49,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67455 conditions, 33989 events. 25296/33989 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 182840 event pairs, 7318 based on Foata normal form. 532/28173 useless extension candidates. Maximal degree in co-relation 67444. Up to 20261 conditions per place. [2023-01-28 01:26:50,131 INFO L137 encePairwiseOnDemand]: 260/273 looper letters, 70 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2023-01-28 01:26:50,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 333 flow [2023-01-28 01:26:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 01:26:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 01:26:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-01-28 01:26:50,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518925518925519 [2023-01-28 01:26:50,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-01-28 01:26:50,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-01-28 01:26:50,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:26:50,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-01-28 01:26:50,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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) [2023-01-28 01:26:50,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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) [2023-01-28 01:26:50,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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) [2023-01-28 01:26:50,156 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 103 flow. Second operand 3 states and 452 transitions. [2023-01-28 01:26:50,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 333 flow [2023-01-28 01:26:50,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 01:26:50,162 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 158 flow [2023-01-28 01:26:50,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-01-28 01:26:50,166 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-01-28 01:26:50,167 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 158 flow [2023-01-28 01:26:50,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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) [2023-01-28 01:26:50,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:26:50,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:26:50,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 01:26:50,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:26:50,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:26:50,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1977470884, now seen corresponding path program 1 times [2023-01-28 01:26:50,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:26:50,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691347790] [2023-01-28 01:26:50,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:26:50,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:26:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:26:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:26:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:26:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691347790] [2023-01-28 01:26:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691347790] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:26:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:26:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 01:26:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121436871] [2023-01-28 01:26:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:26:50,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 01:26:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:26:50,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 01:26:50,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 01:26:50,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 273 [2023-01-28 01:26:50,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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) [2023-01-28 01:26:50,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:26:50,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 273 [2023-01-28 01:26:50,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:26:54,028 INFO L130 PetriNetUnfolder]: 43473/59980 cut-off events. [2023-01-28 01:26:54,029 INFO L131 PetriNetUnfolder]: For 13292/13484 co-relation queries the response was YES. [2023-01-28 01:26:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134039 conditions, 59980 events. 43473/59980 cut-off events. For 13292/13484 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 356460 event pairs, 9892 based on Foata normal form. 2/49790 useless extension candidates. Maximal degree in co-relation 134027. Up to 22670 conditions per place. [2023-01-28 01:26:54,402 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 124 selfloop transitions, 8 changer transitions 0/141 dead transitions. [2023-01-28 01:26:54,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 141 transitions, 682 flow [2023-01-28 01:26:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 01:26:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 01:26:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 765 transitions. [2023-01-28 01:26:54,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5604395604395604 [2023-01-28 01:26:54,407 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 765 transitions. [2023-01-28 01:26:54,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 765 transitions. [2023-01-28 01:26:54,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:26:54,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 765 transitions. [2023-01-28 01:26:54,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 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) [2023-01-28 01:26:54,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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) [2023-01-28 01:26:54,414 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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) [2023-01-28 01:26:54,414 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 158 flow. Second operand 5 states and 765 transitions. [2023-01-28 01:26:54,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 141 transitions, 682 flow [2023-01-28 01:26:54,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 141 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 01:26:54,483 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 218 flow [2023-01-28 01:26:54,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2023-01-28 01:26:54,484 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-01-28 01:26:54,484 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 218 flow [2023-01-28 01:26:54,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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) [2023-01-28 01:26:54,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:26:54,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:26:54,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 01:26:54,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:26:54,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:26:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1430624969, now seen corresponding path program 1 times [2023-01-28 01:26:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:26:54,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544982119] [2023-01-28 01:26:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:26:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:26:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:26:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:26:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:26:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544982119] [2023-01-28 01:26:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544982119] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:26:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:26:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 01:26:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271712267] [2023-01-28 01:26:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:26:54,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 01:26:54,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:26:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 01:26:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 01:26:54,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-01-28 01:26:54,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-01-28 01:26:54,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:26:54,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-01-28 01:26:54,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:26:59,660 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [170#true, 2#L1190true, 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 14#L1161true, Black: 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 159#true, 71#L1173true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 153#true]) [2023-01-28 01:26:59,660 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-01-28 01:26:59,660 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 01:26:59,660 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 01:26:59,660 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 01:26:59,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 2#L1190true, 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 14#L1161true, Black: 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 70#L19-5true, Black: 159#true, 71#L1173true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 153#true]) [2023-01-28 01:26:59,662 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-01-28 01:26:59,662 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 01:26:59,662 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 01:26:59,662 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 01:26:59,822 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [170#true, 2#L1190true, 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 14#L1161true, Black: 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 41#L1211-1true, Black: 159#true, 71#L1173true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 153#true]) [2023-01-28 01:26:59,822 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-01-28 01:26:59,822 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 01:26:59,823 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 01:26:59,823 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-01-28 01:26:59,986 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [170#true, 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 14#L1161true, Black: 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 159#true, 71#L1173true, 17#L1205-6true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 153#true]) [2023-01-28 01:26:59,986 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-01-28 01:26:59,986 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-01-28 01:26:59,986 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 01:26:59,986 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-01-28 01:27:00,086 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 2#L1190true, Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 14#L1161true, Black: 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 159#true, 84#L1206-1true, 71#L1173true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 153#true]) [2023-01-28 01:27:00,087 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-01-28 01:27:00,087 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 01:27:00,087 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 01:27:00,087 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 01:27:00,088 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [170#true, 2#L1190true, 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 14#L1161true, 3#ULTIMATE.startEXITtrue, Black: 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 159#true, 71#L1173true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 153#true]) [2023-01-28 01:27:00,088 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-01-28 01:27:00,088 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-01-28 01:27:00,088 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-01-28 01:27:00,088 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-01-28 01:27:00,372 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 2#L1190true, 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 14#L1161true, Black: 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 159#true, 71#L1173true, 101#L1208true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 153#true]) [2023-01-28 01:27:00,373 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2023-01-28 01:27:00,373 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-01-28 01:27:00,373 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-01-28 01:27:00,373 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-01-28 01:27:00,458 INFO L130 PetriNetUnfolder]: 78276/108750 cut-off events. [2023-01-28 01:27:00,458 INFO L131 PetriNetUnfolder]: For 51514/53982 co-relation queries the response was YES. [2023-01-28 01:27:00,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263985 conditions, 108750 events. 78276/108750 cut-off events. For 51514/53982 co-relation queries the response was YES. Maximal size of possible extension queue 2814. Compared 728908 event pairs, 18650 based on Foata normal form. 2304/98228 useless extension candidates. Maximal degree in co-relation 263969. Up to 64277 conditions per place. [2023-01-28 01:27:01,052 INFO L137 encePairwiseOnDemand]: 261/273 looper letters, 78 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2023-01-28 01:27:01,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 560 flow [2023-01-28 01:27:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 01:27:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 01:27:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-01-28 01:27:01,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5262515262515263 [2023-01-28 01:27:01,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-01-28 01:27:01,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-01-28 01:27:01,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:27:01,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-01-28 01:27:01,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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) [2023-01-28 01:27:01,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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) [2023-01-28 01:27:01,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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) [2023-01-28 01:27:01,064 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 218 flow. Second operand 3 states and 431 transitions. [2023-01-28 01:27:01,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 560 flow [2023-01-28 01:27:01,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 01:27:01,077 INFO L231 Difference]: Finished difference. Result has 58 places, 68 transitions, 307 flow [2023-01-28 01:27:01,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=58, PETRI_TRANSITIONS=68} [2023-01-28 01:27:01,079 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-01-28 01:27:01,079 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 68 transitions, 307 flow [2023-01-28 01:27:01,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-01-28 01:27:01,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:27:01,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:27:01,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 01:27:01,080 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:27:01,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:27:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 626939195, now seen corresponding path program 1 times [2023-01-28 01:27:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:27:01,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400523700] [2023-01-28 01:27:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:27:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:27:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:27:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:27:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:27:01,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400523700] [2023-01-28 01:27:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400523700] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:27:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:27:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 01:27:01,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402052017] [2023-01-28 01:27:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:27:01,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 01:27:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:27:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 01:27:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 01:27:01,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 273 [2023-01-28 01:27:01,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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) [2023-01-28 01:27:01,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:27:01,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 273 [2023-01-28 01:27:01,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:27:02,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][10], [18#L1186-2true, 172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 14#L1161true, 137#L1168-1true, Black: 159#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 180#(and (<= ~B~0 5) (= ~B~0 ~A~0) (<= 5 ~B~0)), Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:02,570 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-01-28 01:27:02,570 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-28 01:27:02,570 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 01:27:02,570 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 01:27:02,774 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][10], [172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 14#L1161true, 137#L1168-1true, Black: 159#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 180#(and (<= ~B~0 5) (= ~B~0 ~A~0) (<= 5 ~B~0)), 135#L1187-1true, Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:02,774 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-01-28 01:27:02,774 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 01:27:02,774 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-01-28 01:27:02,774 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 01:27:02,975 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][64], [18#L1186-2true, 172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 137#L1168-1true, Black: 159#true, 125#L1160true, 177#(and (<= ~B~0 5) (<= 5 ~B~0)), 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:02,975 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-01-28 01:27:02,976 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 01:27:02,976 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 01:27:02,976 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 01:27:03,177 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][10], [130#L1189true, 172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 14#L1161true, 137#L1168-1true, Black: 159#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 180#(and (<= ~B~0 5) (= ~B~0 ~A~0) (<= 5 ~B~0)), Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:03,177 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-01-28 01:27:03,177 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-01-28 01:27:03,177 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 01:27:03,177 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 01:27:03,438 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][64], [172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 137#L1168-1true, Black: 159#true, 125#L1160true, 40#L1210true, 177#(and (<= ~B~0 5) (<= 5 ~B~0)), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 135#L1187-1true, Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:03,438 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-01-28 01:27:03,438 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 01:27:03,439 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-01-28 01:27:03,439 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-28 01:27:03,494 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][10], [172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 2#L1190true, Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 14#L1161true, 137#L1168-1true, Black: 159#true, 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, 180#(and (<= ~B~0 5) (= ~B~0 ~A~0) (<= 5 ~B~0)), Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:03,494 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-01-28 01:27:03,494 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-01-28 01:27:03,494 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-28 01:27:03,494 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-01-28 01:27:03,954 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][64], [130#L1189true, 172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 137#L1168-1true, Black: 159#true, 125#L1160true, 177#(and (<= ~B~0 5) (<= 5 ~B~0)), 40#L1210true, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:03,954 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-01-28 01:27:03,954 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 01:27:03,954 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-01-28 01:27:03,954 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-01-28 01:27:04,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([458] L1167-2-->L1168-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30|))) (and (= (select .cse0 |v_~#mutex_A~0.offset_30|) 0) (= |v_processThread1of1ForFork2_#t~nondet4_7| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#mutex_A~0.base_30| (store .cse0 |v_~#mutex_A~0.offset_30| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, ~#mutex_A~0.base=|v_~#mutex_A~0.base_30|, processThread1of1ForFork2_#t~nondet4=|v_processThread1of1ForFork2_#t~nondet4_7|, ~#mutex_A~0.offset=|v_~#mutex_A~0.offset_30|} AuxVars[] AssignedVars[#pthreadsMutex, processThread1of1ForFork2_#t~nondet4][64], [172#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 2#L1190true, Black: 161#(and (<= ~B~0 5) (<= 5 ~B~0)), 164#(and (<= ~B~0 5) (<= 5 ~B~0) (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), Black: 162#(and (<= |disposeThread1of1ForFork0_~p~0#1| 5) (< 4 |disposeThread1of1ForFork0_~p~0#1|)), 137#L1168-1true, Black: 159#true, 125#L1160true, 40#L1210true, 177#(and (<= ~B~0 5) (<= 5 ~B~0)), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, processThread1of1ForFork2InUse, Black: 155#(= ~B~0 ~A~0)]) [2023-01-28 01:27:04,342 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-01-28 01:27:04,342 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-01-28 01:27:04,342 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 01:27:04,342 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-01-28 01:27:09,502 INFO L130 PetriNetUnfolder]: 110841/149418 cut-off events. [2023-01-28 01:27:09,503 INFO L131 PetriNetUnfolder]: For 120459/121419 co-relation queries the response was YES. [2023-01-28 01:27:09,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433683 conditions, 149418 events. 110841/149418 cut-off events. For 120459/121419 co-relation queries the response was YES. Maximal size of possible extension queue 3237. Compared 934130 event pairs, 28433 based on Foata normal form. 1191/144375 useless extension candidates. Maximal degree in co-relation 433665. Up to 67073 conditions per place. [2023-01-28 01:27:10,225 INFO L137 encePairwiseOnDemand]: 261/273 looper letters, 166 selfloop transitions, 19 changer transitions 0/190 dead transitions. [2023-01-28 01:27:10,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 190 transitions, 1192 flow [2023-01-28 01:27:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 01:27:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 01:27:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 754 transitions. [2023-01-28 01:27:10,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2023-01-28 01:27:10,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 754 transitions. [2023-01-28 01:27:10,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 754 transitions. [2023-01-28 01:27:10,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:27:10,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 754 transitions. [2023-01-28 01:27:10,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 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) [2023-01-28 01:27:10,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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) [2023-01-28 01:27:10,233 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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) [2023-01-28 01:27:10,233 INFO L175 Difference]: Start difference. First operand has 58 places, 68 transitions, 307 flow. Second operand 5 states and 754 transitions. [2023-01-28 01:27:10,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 190 transitions, 1192 flow [2023-01-28 01:27:10,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 190 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 01:27:10,297 INFO L231 Difference]: Finished difference. Result has 64 places, 81 transitions, 445 flow [2023-01-28 01:27:10,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=64, PETRI_TRANSITIONS=81} [2023-01-28 01:27:10,298 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-01-28 01:27:10,298 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 81 transitions, 445 flow [2023-01-28 01:27:10,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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) [2023-01-28 01:27:10,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:27:10,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:27:10,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 01:27:10,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:27:10,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:27:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash 145088733, now seen corresponding path program 1 times [2023-01-28 01:27:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:27:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101888358] [2023-01-28 01:27:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:27:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:27:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:27:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:27:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:27:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101888358] [2023-01-28 01:27:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101888358] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:27:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:27:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 01:27:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825828074] [2023-01-28 01:27:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:27:10,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 01:27:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:27:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 01:27:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 01:27:10,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 273 [2023-01-28 01:27:10,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 81 transitions, 445 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 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) [2023-01-28 01:27:10,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:27:10,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 273 [2023-01-28 01:27:10,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:27:11,438 INFO L130 PetriNetUnfolder]: 10560/15924 cut-off events. [2023-01-28 01:27:11,438 INFO L131 PetriNetUnfolder]: For 18920/19450 co-relation queries the response was YES. [2023-01-28 01:27:11,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44807 conditions, 15924 events. 10560/15924 cut-off events. For 18920/19450 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 92573 event pairs, 1860 based on Foata normal form. 1562/17335 useless extension candidates. Maximal degree in co-relation 44785. Up to 12887 conditions per place. [2023-01-28 01:27:11,518 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 61 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-01-28 01:27:11,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 544 flow [2023-01-28 01:27:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 01:27:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 01:27:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-01-28 01:27:11,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4661172161172161 [2023-01-28 01:27:11,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-01-28 01:27:11,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-01-28 01:27:11,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:27:11,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-01-28 01:27:11,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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) [2023-01-28 01:27:11,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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) [2023-01-28 01:27:11,532 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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) [2023-01-28 01:27:11,532 INFO L175 Difference]: Start difference. First operand has 64 places, 81 transitions, 445 flow. Second operand 4 states and 509 transitions. [2023-01-28 01:27:11,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 544 flow [2023-01-28 01:27:11,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 531 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 01:27:11,551 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 345 flow [2023-01-28 01:27:11,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-01-28 01:27:11,553 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-01-28 01:27:11,554 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 345 flow [2023-01-28 01:27:11,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 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) [2023-01-28 01:27:11,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:27:11,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:27:11,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 01:27:11,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:27:11,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:27:11,555 INFO L85 PathProgramCache]: Analyzing trace with hash 169180723, now seen corresponding path program 1 times [2023-01-28 01:27:11,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:27:11,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964741908] [2023-01-28 01:27:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:27:11,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:27:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:27:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:27:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:27:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964741908] [2023-01-28 01:27:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964741908] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:27:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:27:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 01:27:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514123963] [2023-01-28 01:27:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:27:11,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 01:27:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:27:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 01:27:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 01:27:11,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 273 [2023-01-28 01:27:11,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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) [2023-01-28 01:27:11,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:27:11,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 273 [2023-01-28 01:27:11,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:27:12,472 INFO L130 PetriNetUnfolder]: 7453/11396 cut-off events. [2023-01-28 01:27:12,472 INFO L131 PetriNetUnfolder]: For 10545/10586 co-relation queries the response was YES. [2023-01-28 01:27:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32138 conditions, 11396 events. 7453/11396 cut-off events. For 10545/10586 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 64460 event pairs, 1679 based on Foata normal form. 622/11947 useless extension candidates. Maximal degree in co-relation 32115. Up to 6596 conditions per place. [2023-01-28 01:27:12,538 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 62 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2023-01-28 01:27:12,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 609 flow [2023-01-28 01:27:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 01:27:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 01:27:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-01-28 01:27:12,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2023-01-28 01:27:12,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-01-28 01:27:12,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-01-28 01:27:12,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:27:12,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-01-28 01:27:12,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2023-01-28 01:27:12,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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) [2023-01-28 01:27:12,544 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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) [2023-01-28 01:27:12,544 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 345 flow. Second operand 4 states and 512 transitions. [2023-01-28 01:27:12,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 609 flow [2023-01-28 01:27:12,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 586 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 01:27:12,566 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 363 flow [2023-01-28 01:27:12,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-01-28 01:27:12,567 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-01-28 01:27:12,567 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 363 flow [2023-01-28 01:27:12,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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) [2023-01-28 01:27:12,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:27:12,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:27:12,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 01:27:12,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:27:12,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:27:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1132651350, now seen corresponding path program 1 times [2023-01-28 01:27:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:27:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75106338] [2023-01-28 01:27:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:27:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:27:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:27:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:27:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:27:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75106338] [2023-01-28 01:27:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75106338] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:27:12,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:27:12,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 01:27:12,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194107885] [2023-01-28 01:27:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:27:12,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 01:27:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:27:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 01:27:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-01-28 01:27:12,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-01-28 01:27:12,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 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) [2023-01-28 01:27:12,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:27:12,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-01-28 01:27:12,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:27:14,976 INFO L130 PetriNetUnfolder]: 19886/28840 cut-off events. [2023-01-28 01:27:14,976 INFO L131 PetriNetUnfolder]: For 31545/31546 co-relation queries the response was YES. [2023-01-28 01:27:15,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83123 conditions, 28840 events. 19886/28840 cut-off events. For 31545/31546 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 154281 event pairs, 3962 based on Foata normal form. 1353/30139 useless extension candidates. Maximal degree in co-relation 83099. Up to 7455 conditions per place. [2023-01-28 01:27:15,168 INFO L137 encePairwiseOnDemand]: 256/273 looper letters, 353 selfloop transitions, 72 changer transitions 3/433 dead transitions. [2023-01-28 01:27:15,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 433 transitions, 2810 flow [2023-01-28 01:27:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 01:27:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-28 01:27:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3120 transitions. [2023-01-28 01:27:15,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968944099378882 [2023-01-28 01:27:15,177 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3120 transitions. [2023-01-28 01:27:15,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3120 transitions. [2023-01-28 01:27:15,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:27:15,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3120 transitions. [2023-01-28 01:27:15,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 135.65217391304347) internal successors, (3120), 23 states have internal predecessors, (3120), 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) [2023-01-28 01:27:15,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 273.0) internal successors, (6552), 24 states have internal predecessors, (6552), 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) [2023-01-28 01:27:15,196 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 273.0) internal successors, (6552), 24 states have internal predecessors, (6552), 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) [2023-01-28 01:27:15,196 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 363 flow. Second operand 23 states and 3120 transitions. [2023-01-28 01:27:15,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 433 transitions, 2810 flow [2023-01-28 01:27:15,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 433 transitions, 2722 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 01:27:15,256 INFO L231 Difference]: Finished difference. Result has 107 places, 129 transitions, 1175 flow [2023-01-28 01:27:15,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1175, PETRI_PLACES=107, PETRI_TRANSITIONS=129} [2023-01-28 01:27:15,257 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2023-01-28 01:27:15,257 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 129 transitions, 1175 flow [2023-01-28 01:27:15,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 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) [2023-01-28 01:27:15,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:27:15,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:27:15,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 01:27:15,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:27:15,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:27:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash 913437036, now seen corresponding path program 1 times [2023-01-28 01:27:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:27:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560809376] [2023-01-28 01:27:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:27:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:27:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:27:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 01:27:15,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:27:15,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560809376] [2023-01-28 01:27:15,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560809376] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 01:27:15,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 01:27:15,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 01:27:15,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085732752] [2023-01-28 01:27:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 01:27:15,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 01:27:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:27:15,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 01:27:15,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 01:27:15,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 273 [2023-01-28 01:27:15,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 129 transitions, 1175 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 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) [2023-01-28 01:27:15,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:27:15,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 273 [2023-01-28 01:27:15,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:27:17,684 INFO L130 PetriNetUnfolder]: 19832/28719 cut-off events. [2023-01-28 01:27:17,685 INFO L131 PetriNetUnfolder]: For 151904/151905 co-relation queries the response was YES. [2023-01-28 01:27:17,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111613 conditions, 28719 events. 19832/28719 cut-off events. For 151904/151905 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 155069 event pairs, 9448 based on Foata normal form. 35/28738 useless extension candidates. Maximal degree in co-relation 111568. Up to 16102 conditions per place. [2023-01-28 01:27:17,888 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 166 selfloop transitions, 34 changer transitions 0/205 dead transitions. [2023-01-28 01:27:17,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 205 transitions, 2186 flow [2023-01-28 01:27:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 01:27:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 01:27:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2023-01-28 01:27:17,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157509157509158 [2023-01-28 01:27:17,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2023-01-28 01:27:17,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2023-01-28 01:27:17,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:27:17,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2023-01-28 01:27:17,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 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) [2023-01-28 01:27:17,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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) [2023-01-28 01:27:17,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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) [2023-01-28 01:27:17,896 INFO L175 Difference]: Start difference. First operand has 107 places, 129 transitions, 1175 flow. Second operand 5 states and 704 transitions. [2023-01-28 01:27:17,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 205 transitions, 2186 flow [2023-01-28 01:27:18,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 205 transitions, 2150 flow, removed 18 selfloop flow, removed 0 redundant places. [2023-01-28 01:27:18,300 INFO L231 Difference]: Finished difference. Result has 113 places, 130 transitions, 1295 flow [2023-01-28 01:27:18,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1295, PETRI_PLACES=113, PETRI_TRANSITIONS=130} [2023-01-28 01:27:18,300 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 63 predicate places. [2023-01-28 01:27:18,301 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 130 transitions, 1295 flow [2023-01-28 01:27:18,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 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) [2023-01-28 01:27:18,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 01:27:18,301 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:27:18,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 01:27:18,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 01:27:18,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 01:27:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 20605788, now seen corresponding path program 1 times [2023-01-28 01:27:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 01:27:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135206234] [2023-01-28 01:27:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:27:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 01:27:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:27:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 01:27:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 01:27:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135206234] [2023-01-28 01:27:18,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135206234] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 01:27:18,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873135162] [2023-01-28 01:27:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 01:27:18,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 01:27:18,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 01:27:18,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 01:27:18,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 01:27:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 01:27:18,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjunts are in the unsatisfiable core [2023-01-28 01:27:18,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 01:27:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 01:27:19,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 01:27:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 01:27:19,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873135162] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 01:27:19,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 01:27:19,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-01-28 01:27:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013987461] [2023-01-28 01:27:19,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 01:27:19,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 01:27:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 01:27:19,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 01:27:19,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-01-28 01:27:19,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 273 [2023-01-28 01:27:19,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 130 transitions, 1295 flow. Second operand has 9 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 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) [2023-01-28 01:27:19,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 01:27:19,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 273 [2023-01-28 01:27:19,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 01:27:21,223 INFO L130 PetriNetUnfolder]: 13521/19970 cut-off events. [2023-01-28 01:27:21,224 INFO L131 PetriNetUnfolder]: For 127934/127935 co-relation queries the response was YES. [2023-01-28 01:27:21,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70778 conditions, 19970 events. 13521/19970 cut-off events. For 127934/127935 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 105670 event pairs, 2818 based on Foata normal form. 1290/21259 useless extension candidates. Maximal degree in co-relation 70729. Up to 6820 conditions per place. [2023-01-28 01:27:21,308 INFO L137 encePairwiseOnDemand]: 257/273 looper letters, 0 selfloop transitions, 0 changer transitions 293/293 dead transitions. [2023-01-28 01:27:21,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 293 transitions, 2788 flow [2023-01-28 01:27:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-28 01:27:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-28 01:27:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2083 transitions. [2023-01-28 01:27:21,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4768772893772894 [2023-01-28 01:27:21,314 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2083 transitions. [2023-01-28 01:27:21,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2083 transitions. [2023-01-28 01:27:21,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 01:27:21,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2083 transitions. [2023-01-28 01:27:21,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 130.1875) internal successors, (2083), 16 states have internal predecessors, (2083), 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) [2023-01-28 01:27:21,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 273.0) internal successors, (4641), 17 states have internal predecessors, (4641), 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) [2023-01-28 01:27:21,326 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 273.0) internal successors, (4641), 17 states have internal predecessors, (4641), 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) [2023-01-28 01:27:21,326 INFO L175 Difference]: Start difference. First operand has 113 places, 130 transitions, 1295 flow. Second operand 16 states and 2083 transitions. [2023-01-28 01:27:21,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 293 transitions, 2788 flow [2023-01-28 01:27:21,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 293 transitions, 2696 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-01-28 01:27:21,647 INFO L231 Difference]: Finished difference. Result has 119 places, 0 transitions, 0 flow [2023-01-28 01:27:21,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=119, PETRI_TRANSITIONS=0} [2023-01-28 01:27:21,647 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 69 predicate places. [2023-01-28 01:27:21,647 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 0 transitions, 0 flow [2023-01-28 01:27:21,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 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) [2023-01-28 01:27:21,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 01:27:21,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-01-28 01:27:21,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 01:27:21,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 01:27:21,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-01-28 01:27:21,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 01:27:21,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 01:27:21,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 01:27:21,857 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 01:27:21,861 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 01:27:21,861 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 01:27:21,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 01:27:21 BasicIcfg [2023-01-28 01:27:21,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 01:27:21,865 INFO L158 Benchmark]: Toolchain (without parser) took 39739.88ms. Allocated memory was 339.7MB in the beginning and 13.0GB in the end (delta: 12.7GB). Free memory was 296.8MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-01-28 01:27:21,865 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 01:27:21,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.32ms. Allocated memory is still 339.7MB. Free memory was 296.4MB in the beginning and 266.8MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-01-28 01:27:21,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.13ms. Allocated memory is still 339.7MB. Free memory was 266.8MB in the beginning and 264.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 01:27:21,866 INFO L158 Benchmark]: Boogie Preprocessor took 45.52ms. Allocated memory is still 339.7MB. Free memory was 263.9MB in the beginning and 261.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 01:27:21,866 INFO L158 Benchmark]: RCFGBuilder took 520.93ms. Allocated memory is still 339.7MB. Free memory was 261.5MB in the beginning and 303.6MB in the end (delta: -42.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.0GB. [2023-01-28 01:27:21,866 INFO L158 Benchmark]: TraceAbstraction took 38513.72ms. Allocated memory was 339.7MB in the beginning and 13.0GB in the end (delta: 12.7GB). Free memory was 303.1MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-01-28 01:27:21,868 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.10ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 613.32ms. Allocated memory is still 339.7MB. Free memory was 296.4MB in the beginning and 266.8MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.13ms. Allocated memory is still 339.7MB. Free memory was 266.8MB in the beginning and 264.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 45.52ms. Allocated memory is still 339.7MB. Free memory was 263.9MB in the beginning and 261.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 520.93ms. Allocated memory is still 339.7MB. Free memory was 261.5MB in the beginning and 303.6MB in the end (delta: -42.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.0GB. * TraceAbstraction took 38513.72ms. Allocated memory was 339.7MB in the beginning and 13.0GB in the end (delta: 12.7GB). Free memory was 303.1MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 147 PlacesBefore, 50 PlacesAfterwards, 149 TransitionsBefore, 47 TransitionsAfterwards, 8738 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 5 ChoiceCompositions, 121 TotalNumberOfCompositions, 18789 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8699, independent: 8346, independent conditional: 0, independent unconditional: 8346, dependent: 353, dependent conditional: 0, dependent unconditional: 353, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4415, independent: 4335, independent conditional: 0, independent unconditional: 4335, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8699, independent: 4011, independent conditional: 0, independent unconditional: 4011, dependent: 273, dependent conditional: 0, dependent unconditional: 273, unknown: 4415, unknown conditional: 0, unknown unconditional: 4415] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 254, Positive conditional cache size: 0, Positive unconditional cache size: 254, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 208 locations, 6 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: 38.4s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 847 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 847 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2387 IncrementalHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 14 mSDtfsCounter, 2387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1295occurred in iteration=8, InterpolantAutomatonStates: 68, 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, 2.3s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 1380 SizeOfPredicates, 7 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-01-28 01:27:21,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...