./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 01:12:40,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 01:12:40,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 01:12:40,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 01:12:40,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 01:12:40,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 01:12:40,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 01:12:40,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 01:12:40,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 01:12:40,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 01:12:40,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 01:12:40,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 01:12:40,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 01:12:40,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 01:12:40,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 01:12:40,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 01:12:40,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 01:12:40,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 01:12:40,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 01:12:40,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 01:12:40,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 01:12:40,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 01:12:40,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 01:12:40,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 01:12:40,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 01:12:40,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 01:12:40,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 01:12:40,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 01:12:40,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 01:12:40,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 01:12:40,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 01:12:40,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 01:12:40,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 01:12:40,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 01:12:40,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 01:12:40,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 01:12:40,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 01:12:40,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 01:12:40,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 01:12:40,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 01:12:40,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 01:12:40,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 01:12:40,166 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 01:12:40,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 01:12:40,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 01:12:40,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 01:12:40,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 01:12:40,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 01:12:40,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 01:12:40,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 01:12:40,169 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 01:12:40,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 01:12:40,170 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 01:12:40,170 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 01:12:40,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 01:12:40,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 01:12:40,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 01:12:40,171 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 01:12:40,171 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 01:12:40,171 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 01:12:40,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 01:12:40,172 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 01:12:40,172 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 01:12:40,172 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 01:12:40,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 01:12:40,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 01:12:40,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 01:12:40,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:12:40,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 01:12:40,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 01:12:40,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 01:12:40,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 01:12:40,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 01:12:40,174 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 01:12:40,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 01:12:40,174 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 01:12:40,175 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 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-09-01 01:12:40,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 01:12:40,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 01:12:40,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 01:12:40,495 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 01:12:40,495 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 01:12:40,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-09-01 01:12:41,786 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 01:12:42,051 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 01:12:42,051 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-09-01 01:12:42,065 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536d76490/d06968c97905423ab87aa44ec2cccfd5/FLAG9c0a4a0d9 [2023-09-01 01:12:42,078 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536d76490/d06968c97905423ab87aa44ec2cccfd5 [2023-09-01 01:12:42,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 01:12:42,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 01:12:42,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 01:12:42,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 01:12:42,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 01:12:42,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cce5121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42, skipping insertion in model container [2023-09-01 01:12:42,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 01:12:42,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 01:12:42,235 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/36-apron_21-traces-cluster-based_true.i[1092,1105] [2023-09-01 01:12:42,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:12:42,413 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 01:12:42,427 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/36-apron_21-traces-cluster-based_true.i[1092,1105] [2023-09-01 01:12:42,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:12:42,555 INFO L208 MainTranslator]: Completed translation [2023-09-01 01:12:42,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42 WrapperNode [2023-09-01 01:12:42,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 01:12:42,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 01:12:42,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 01:12:42,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 01:12:42,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,595 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2023-09-01 01:12:42,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 01:12:42,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 01:12:42,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 01:12:42,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 01:12:42,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,618 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 01:12:42,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 01:12:42,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 01:12:42,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 01:12:42,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (1/1) ... [2023-09-01 01:12:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:12:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:12:42,653 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-09-01 01:12:42,667 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-09-01 01:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-09-01 01:12:42,686 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-09-01 01:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 01:12:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 01:12:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 01:12:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 01:12:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-09-01 01:12:42,687 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-09-01 01:12:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-09-01 01:12:42,687 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-09-01 01:12:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 01:12:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 01:12:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 01:12:42,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 01:12:42,689 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 01:12:42,792 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 01:12:42,794 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 01:12:43,070 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 01:12:43,077 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 01:12:43,078 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 01:12:43,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:12:43 BoogieIcfgContainer [2023-09-01 01:12:43,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 01:12:43,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 01:12:43,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 01:12:43,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 01:12:43,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:12:42" (1/3) ... [2023-09-01 01:12:43,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d8cbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:12:43, skipping insertion in model container [2023-09-01 01:12:43,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:12:42" (2/3) ... [2023-09-01 01:12:43,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d8cbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:12:43, skipping insertion in model container [2023-09-01 01:12:43,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:12:43" (3/3) ... [2023-09-01 01:12:43,086 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-09-01 01:12:43,110 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 01:12:43,110 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-09-01 01:12:43,110 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 01:12:43,236 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 01:12:43,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 172 transitions, 359 flow [2023-09-01 01:12:43,337 INFO L130 PetriNetUnfolder]: 5/169 cut-off events. [2023-09-01 01:12:43,337 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:12:43,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 5/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 289 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-09-01 01:12:43,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 172 transitions, 359 flow [2023-09-01 01:12:43,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 169 transitions, 347 flow [2023-09-01 01:12:43,361 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 01:12:43,376 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 169 transitions, 347 flow [2023-09-01 01:12:43,378 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 169 transitions, 347 flow [2023-09-01 01:12:43,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 347 flow [2023-09-01 01:12:43,412 INFO L130 PetriNetUnfolder]: 5/169 cut-off events. [2023-09-01 01:12:43,413 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:12:43,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 5/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 289 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-09-01 01:12:43,419 INFO L119 LiptonReduction]: Number of co-enabled transitions 9966 [2023-09-01 01:12:48,751 INFO L134 LiptonReduction]: Checked pairs total: 21593 [2023-09-01 01:12:48,752 INFO L136 LiptonReduction]: Total number of compositions: 171 [2023-09-01 01:12:48,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 01:12:48,770 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=All, 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;@f6731f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 01:12:48,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-09-01 01:12:48,772 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 01:12:48,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:12:48,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:48,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 01:12:48,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:48,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash 643, now seen corresponding path program 1 times [2023-09-01 01:12:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233848100] [2023-09-01 01:12:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233848100] [2023-09-01 01:12:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233848100] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 01:12:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131550324] [2023-09-01 01:12:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:48,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 01:12:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 01:12:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 01:12:48,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 343 [2023-09-01 01:12:48,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 101 flow. Second operand has 2 states, 2 states have (on average 161.5) internal successors, (323), 2 states have internal predecessors, (323), 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-09-01 01:12:48,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:48,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 343 [2023-09-01 01:12:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:49,449 INFO L130 PetriNetUnfolder]: 3211/5177 cut-off events. [2023-09-01 01:12:49,449 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-09-01 01:12:49,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9776 conditions, 5177 events. 3211/5177 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 34555 event pairs, 2947 based on Foata normal form. 150/3821 useless extension candidates. Maximal degree in co-relation 9765. Up to 4533 conditions per place. [2023-09-01 01:12:49,482 INFO L137 encePairwiseOnDemand]: 340/343 looper letters, 31 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-09-01 01:12:49,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 157 flow [2023-09-01 01:12:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 01:12:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 01:12:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 356 transitions. [2023-09-01 01:12:49,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189504373177842 [2023-09-01 01:12:49,495 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 356 transitions. [2023-09-01 01:12:49,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 356 transitions. [2023-09-01 01:12:49,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:49,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 356 transitions. [2023-09-01 01:12:49,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 178.0) internal successors, (356), 2 states have internal predecessors, (356), 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-09-01 01:12:49,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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-09-01 01:12:49,507 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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-09-01 01:12:49,509 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 101 flow. Second operand 2 states and 356 transitions. [2023-09-01 01:12:49,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 157 flow [2023-09-01 01:12:49,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 01:12:49,513 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 92 flow [2023-09-01 01:12:49,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-09-01 01:12:49,517 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2023-09-01 01:12:49,518 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 92 flow [2023-09-01 01:12:49,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 161.5) internal successors, (323), 2 states have internal predecessors, (323), 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-09-01 01:12:49,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:49,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:12:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 01:12:49,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:49,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 631149, now seen corresponding path program 1 times [2023-09-01 01:12:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:49,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506634250] [2023-09-01 01:12:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:49,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:49,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506634250] [2023-09-01 01:12:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506634250] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:12:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991685795] [2023-09-01 01:12:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:49,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:12:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:12:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:12:49,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 343 [2023-09-01 01:12:49,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-09-01 01:12:49,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:49,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 343 [2023-09-01 01:12:49,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:50,291 INFO L130 PetriNetUnfolder]: 3206/5062 cut-off events. [2023-09-01 01:12:50,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:12:50,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9649 conditions, 5062 events. 3206/5062 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 32266 event pairs, 2213 based on Foata normal form. 0/3562 useless extension candidates. Maximal degree in co-relation 9646. Up to 3432 conditions per place. [2023-09-01 01:12:50,318 INFO L137 encePairwiseOnDemand]: 339/343 looper letters, 41 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2023-09-01 01:12:50,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 206 flow [2023-09-01 01:12:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:12:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:12:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-09-01 01:12:50,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2023-09-01 01:12:50,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-09-01 01:12:50,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-09-01 01:12:50,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:50,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-09-01 01:12:50,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-09-01 01:12:50,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:50,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:50,335 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 92 flow. Second operand 3 states and 504 transitions. [2023-09-01 01:12:50,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 206 flow [2023-09-01 01:12:50,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:12:50,337 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 96 flow [2023-09-01 01:12:50,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-09-01 01:12:50,338 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-09-01 01:12:50,338 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 96 flow [2023-09-01 01:12:50,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-09-01 01:12:50,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:50,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:12:50,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 01:12:50,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:50,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 631150, now seen corresponding path program 1 times [2023-09-01 01:12:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:50,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162655712] [2023-09-01 01:12:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:50,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:50,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162655712] [2023-09-01 01:12:50,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162655712] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:50,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:50,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:12:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697573757] [2023-09-01 01:12:50,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:50,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:12:50,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:50,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:12:50,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:12:50,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 343 [2023-09-01 01:12:50,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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-09-01 01:12:50,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:50,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 343 [2023-09-01 01:12:50,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:50,923 INFO L130 PetriNetUnfolder]: 3201/5047 cut-off events. [2023-09-01 01:12:50,923 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2023-09-01 01:12:50,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9926 conditions, 5047 events. 3201/5047 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 32314 event pairs, 2209 based on Foata normal form. 0/3653 useless extension candidates. Maximal degree in co-relation 9922. Up to 3422 conditions per place. [2023-09-01 01:12:50,954 INFO L137 encePairwiseOnDemand]: 339/343 looper letters, 40 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-09-01 01:12:50,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 208 flow [2023-09-01 01:12:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:12:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:12:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2023-09-01 01:12:50,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500485908649174 [2023-09-01 01:12:50,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2023-09-01 01:12:50,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2023-09-01 01:12:50,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:50,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2023-09-01 01:12:50,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-09-01 01:12:50,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:50,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:50,962 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 96 flow. Second operand 3 states and 515 transitions. [2023-09-01 01:12:50,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 208 flow [2023-09-01 01:12:50,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 01:12:50,992 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 94 flow [2023-09-01 01:12:50,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-09-01 01:12:50,993 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2023-09-01 01:12:50,993 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 94 flow [2023-09-01 01:12:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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-09-01 01:12:50,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:50,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:12:50,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 01:12:50,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:50,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 606550234, now seen corresponding path program 1 times [2023-09-01 01:12:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237827613] [2023-09-01 01:12:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:51,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:51,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237827613] [2023-09-01 01:12:51,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237827613] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:12:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578332159] [2023-09-01 01:12:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:51,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:12:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:12:51,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:12:51,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 343 [2023-09-01 01:12:51,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-09-01 01:12:51,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:51,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 343 [2023-09-01 01:12:51,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:51,543 INFO L130 PetriNetUnfolder]: 3156/4972 cut-off events. [2023-09-01 01:12:51,544 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2023-09-01 01:12:51,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9781 conditions, 4972 events. 3156/4972 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 31790 event pairs, 2169 based on Foata normal form. 0/3615 useless extension candidates. Maximal degree in co-relation 9777. Up to 3352 conditions per place. [2023-09-01 01:12:51,605 INFO L137 encePairwiseOnDemand]: 339/343 looper letters, 39 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2023-09-01 01:12:51,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 204 flow [2023-09-01 01:12:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:12:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:12:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2023-09-01 01:12:51,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878522837706511 [2023-09-01 01:12:51,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2023-09-01 01:12:51,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2023-09-01 01:12:51,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:51,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2023-09-01 01:12:51,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-09-01 01:12:51,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:51,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:51,612 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 94 flow. Second operand 3 states and 502 transitions. [2023-09-01 01:12:51,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 204 flow [2023-09-01 01:12:51,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 01:12:51,620 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 92 flow [2023-09-01 01:12:51,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-09-01 01:12:51,620 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-09-01 01:12:51,621 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 92 flow [2023-09-01 01:12:51,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-09-01 01:12:51,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:51,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:12:51,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 01:12:51,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:51,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 606550235, now seen corresponding path program 1 times [2023-09-01 01:12:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838532576] [2023-09-01 01:12:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838532576] [2023-09-01 01:12:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838532576] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:51,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:51,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:12:51,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315749379] [2023-09-01 01:12:51,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:51,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:12:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:51,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:12:51,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:12:51,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 343 [2023-09-01 01:12:51,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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-09-01 01:12:51,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:51,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 343 [2023-09-01 01:12:51,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:52,084 INFO L130 PetriNetUnfolder]: 3111/4897 cut-off events. [2023-09-01 01:12:52,084 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2023-09-01 01:12:52,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9636 conditions, 4897 events. 3111/4897 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 31300 event pairs, 2129 based on Foata normal form. 0/3577 useless extension candidates. Maximal degree in co-relation 9632. Up to 3282 conditions per place. [2023-09-01 01:12:52,106 INFO L137 encePairwiseOnDemand]: 339/343 looper letters, 38 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-09-01 01:12:52,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 200 flow [2023-09-01 01:12:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:12:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:12:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-09-01 01:12:52,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2023-09-01 01:12:52,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-09-01 01:12:52,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-09-01 01:12:52,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:52,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-09-01 01:12:52,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-09-01 01:12:52,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:52,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:52,113 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 92 flow. Second operand 3 states and 513 transitions. [2023-09-01 01:12:52,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 200 flow [2023-09-01 01:12:52,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 01:12:52,119 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 90 flow [2023-09-01 01:12:52,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-09-01 01:12:52,120 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-09-01 01:12:52,120 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 90 flow [2023-09-01 01:12:52,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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-09-01 01:12:52,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:52,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:52,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 01:12:52,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:52,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash 811449348, now seen corresponding path program 1 times [2023-09-01 01:12:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:52,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496256559] [2023-09-01 01:12:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:52,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:52,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496256559] [2023-09-01 01:12:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496256559] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:12:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364634694] [2023-09-01 01:12:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:52,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 01:12:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:52,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 01:12:52,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 01:12:52,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 343 [2023-09-01 01:12:52,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 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-09-01 01:12:52,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:52,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 343 [2023-09-01 01:12:52,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:52,897 INFO L130 PetriNetUnfolder]: 5293/8160 cut-off events. [2023-09-01 01:12:52,897 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2023-09-01 01:12:52,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16369 conditions, 8160 events. 5293/8160 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 56381 event pairs, 1009 based on Foata normal form. 0/6392 useless extension candidates. Maximal degree in co-relation 16365. Up to 3397 conditions per place. [2023-09-01 01:12:52,982 INFO L137 encePairwiseOnDemand]: 336/343 looper letters, 123 selfloop transitions, 10 changer transitions 0/143 dead transitions. [2023-09-01 01:12:52,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 143 transitions, 602 flow [2023-09-01 01:12:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 01:12:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 01:12:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1352 transitions. [2023-09-01 01:12:52,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49271137026239065 [2023-09-01 01:12:52,987 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1352 transitions. [2023-09-01 01:12:52,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1352 transitions. [2023-09-01 01:12:52,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:52,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1352 transitions. [2023-09-01 01:12:52,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 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-09-01 01:12:52,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 343.0) internal successors, (3087), 9 states have internal predecessors, (3087), 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-09-01 01:12:52,998 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 343.0) internal successors, (3087), 9 states have internal predecessors, (3087), 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-09-01 01:12:52,998 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 90 flow. Second operand 8 states and 1352 transitions. [2023-09-01 01:12:52,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 143 transitions, 602 flow [2023-09-01 01:12:53,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 143 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 01:12:53,004 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 153 flow [2023-09-01 01:12:53,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=153, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-09-01 01:12:53,007 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2023-09-01 01:12:53,007 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 153 flow [2023-09-01 01:12:53,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 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-09-01 01:12:53,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:53,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:53,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 01:12:53,009 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:53,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1999356674, now seen corresponding path program 1 times [2023-09-01 01:12:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061774487] [2023-09-01 01:12:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061774487] [2023-09-01 01:12:53,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061774487] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:53,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:53,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:12:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182252026] [2023-09-01 01:12:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:53,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 01:12:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 01:12:53,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 01:12:53,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 343 [2023-09-01 01:12:53,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 153 flow. Second operand has 5 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-09-01 01:12:53,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:53,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 343 [2023-09-01 01:12:53,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:54,074 INFO L130 PetriNetUnfolder]: 5989/9531 cut-off events. [2023-09-01 01:12:54,074 INFO L131 PetriNetUnfolder]: For 5957/6284 co-relation queries the response was YES. [2023-09-01 01:12:54,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22813 conditions, 9531 events. 5989/9531 cut-off events. For 5957/6284 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 66301 event pairs, 1125 based on Foata normal form. 135/8179 useless extension candidates. Maximal degree in co-relation 22804. Up to 3267 conditions per place. [2023-09-01 01:12:54,124 INFO L137 encePairwiseOnDemand]: 335/343 looper letters, 107 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2023-09-01 01:12:54,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 138 transitions, 705 flow [2023-09-01 01:12:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 01:12:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 01:12:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1323 transitions. [2023-09-01 01:12:54,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-09-01 01:12:54,128 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1323 transitions. [2023-09-01 01:12:54,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1323 transitions. [2023-09-01 01:12:54,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:54,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1323 transitions. [2023-09-01 01:12:54,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 165.375) internal successors, (1323), 8 states have internal predecessors, (1323), 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-09-01 01:12:54,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 343.0) internal successors, (3087), 9 states have internal predecessors, (3087), 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-09-01 01:12:54,136 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 343.0) internal successors, (3087), 9 states have internal predecessors, (3087), 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-09-01 01:12:54,136 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 153 flow. Second operand 8 states and 1323 transitions. [2023-09-01 01:12:54,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 138 transitions, 705 flow [2023-09-01 01:12:54,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 138 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:12:54,185 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 328 flow [2023-09-01 01:12:54,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-09-01 01:12:54,185 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2023-09-01 01:12:54,186 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 328 flow [2023-09-01 01:12:54,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-09-01 01:12:54,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:54,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:54,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 01:12:54,186 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:54,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1668325902, now seen corresponding path program 1 times [2023-09-01 01:12:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657879552] [2023-09-01 01:12:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657879552] [2023-09-01 01:12:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657879552] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:54,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:12:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166753485] [2023-09-01 01:12:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:54,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:12:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:12:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:12:54,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 343 [2023-09-01 01:12:54,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-09-01 01:12:54,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:54,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 343 [2023-09-01 01:12:54,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:54,797 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 47#L736true, Black: 217#true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,798 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,798 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,798 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,798 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,798 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 47#L736true, Black: 217#true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 180#true]) [2023-09-01 01:12:54,798 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,798 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,798 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,798 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,837 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 47#L736true, Black: 217#true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), 15#L694true, Black: 199#true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,837 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,837 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,838 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 47#L736true, Black: 217#true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), 15#L694true, Black: 199#true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,838 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,838 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,839 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 01:12:54,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, 36#L737true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,844 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,844 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,844 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,844 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 217#true, 36#L737true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), 15#L694true, Black: 199#true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,846 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,846 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,846 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,846 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,891 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, 36#L737true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,891 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,891 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,891 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,891 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,892 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,893 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 217#true, 36#L737true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,893 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,893 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,893 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,893 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,893 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:54,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 2#ULTIMATE.startEXITtrue, Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,898 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,898 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,898 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,898 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,898 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 80#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,899 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,899 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,899 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,899 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,899 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, 2#ULTIMATE.startEXITtrue, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 217#true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,900 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,900 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,900 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,900 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,900 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 80#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 217#true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,900 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,900 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,901 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,901 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,940 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, 2#ULTIMATE.startEXITtrue, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,940 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,940 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,940 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,940 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,940 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 80#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, 153#t3_funEXITtrue, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,941 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, 2#ULTIMATE.startEXITtrue, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 217#true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,941 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,941 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,942 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][69], [235#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 80#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 217#true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, Black: 201#(<= ~h~0 ~g~0), Black: 199#true, 15#L694true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|))]) [2023-09-01 01:12:54,942 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,942 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,942 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,942 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,942 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 01:12:54,992 INFO L130 PetriNetUnfolder]: 5504/9502 cut-off events. [2023-09-01 01:12:54,992 INFO L131 PetriNetUnfolder]: For 7450/7801 co-relation queries the response was YES. [2023-09-01 01:12:55,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24132 conditions, 9502 events. 5504/9502 cut-off events. For 7450/7801 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 69585 event pairs, 2478 based on Foata normal form. 1162/9361 useless extension candidates. Maximal degree in co-relation 24117. Up to 5307 conditions per place. [2023-09-01 01:12:55,041 INFO L137 encePairwiseOnDemand]: 328/343 looper letters, 60 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2023-09-01 01:12:55,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 600 flow [2023-09-01 01:12:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:12:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:12:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2023-09-01 01:12:55,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49076773566569487 [2023-09-01 01:12:55,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2023-09-01 01:12:55,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2023-09-01 01:12:55,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:55,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2023-09-01 01:12:55,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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-09-01 01:12:55,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:55,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:55,047 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 328 flow. Second operand 3 states and 505 transitions. [2023-09-01 01:12:55,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 600 flow [2023-09-01 01:12:55,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 93 transitions, 596 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-09-01 01:12:55,122 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 410 flow [2023-09-01 01:12:55,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2023-09-01 01:12:55,124 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2023-09-01 01:12:55,124 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 410 flow [2023-09-01 01:12:55,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-09-01 01:12:55,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:55,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:55,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 01:12:55,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:55,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1605803238, now seen corresponding path program 1 times [2023-09-01 01:12:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:55,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602473288] [2023-09-01 01:12:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:55,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602473288] [2023-09-01 01:12:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602473288] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:55,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:55,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:12:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500068408] [2023-09-01 01:12:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:55,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 01:12:55,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:55,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 01:12:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 01:12:55,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 343 [2023-09-01 01:12:55,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 154.2) internal successors, (771), 5 states have internal predecessors, (771), 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-09-01 01:12:55,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:55,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 343 [2023-09-01 01:12:55,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:56,034 INFO L130 PetriNetUnfolder]: 5367/9390 cut-off events. [2023-09-01 01:12:56,035 INFO L131 PetriNetUnfolder]: For 13253/13617 co-relation queries the response was YES. [2023-09-01 01:12:56,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30006 conditions, 9390 events. 5367/9390 cut-off events. For 13253/13617 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 68191 event pairs, 1315 based on Foata normal form. 106/8333 useless extension candidates. Maximal degree in co-relation 29989. Up to 3760 conditions per place. [2023-09-01 01:12:56,085 INFO L137 encePairwiseOnDemand]: 336/343 looper letters, 110 selfloop transitions, 31 changer transitions 1/162 dead transitions. [2023-09-01 01:12:56,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 162 transitions, 1194 flow [2023-09-01 01:12:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 01:12:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 01:12:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1313 transitions. [2023-09-01 01:12:56,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4784985422740525 [2023-09-01 01:12:56,089 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1313 transitions. [2023-09-01 01:12:56,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1313 transitions. [2023-09-01 01:12:56,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:56,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1313 transitions. [2023-09-01 01:12:56,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 164.125) internal successors, (1313), 8 states have internal predecessors, (1313), 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-09-01 01:12:56,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 343.0) internal successors, (3087), 9 states have internal predecessors, (3087), 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-09-01 01:12:56,096 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 343.0) internal successors, (3087), 9 states have internal predecessors, (3087), 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-09-01 01:12:56,096 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 410 flow. Second operand 8 states and 1313 transitions. [2023-09-01 01:12:56,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 162 transitions, 1194 flow [2023-09-01 01:12:56,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 162 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:12:56,204 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 701 flow [2023-09-01 01:12:56,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=701, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2023-09-01 01:12:56,205 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 32 predicate places. [2023-09-01 01:12:56,205 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 701 flow [2023-09-01 01:12:56,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.2) internal successors, (771), 5 states have internal predecessors, (771), 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-09-01 01:12:56,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:56,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:56,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 01:12:56,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:56,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 223264633, now seen corresponding path program 1 times [2023-09-01 01:12:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901337724] [2023-09-01 01:12:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901337724] [2023-09-01 01:12:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901337724] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:56,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:56,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 01:12:56,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178589235] [2023-09-01 01:12:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:56,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:12:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:12:56,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:12:56,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 343 [2023-09-01 01:12:56,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 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-09-01 01:12:56,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:56,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 343 [2023-09-01 01:12:56,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:57,450 INFO L130 PetriNetUnfolder]: 6648/11513 cut-off events. [2023-09-01 01:12:57,450 INFO L131 PetriNetUnfolder]: For 23314/23501 co-relation queries the response was YES. [2023-09-01 01:12:57,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37838 conditions, 11513 events. 6648/11513 cut-off events. For 23314/23501 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 85385 event pairs, 1719 based on Foata normal form. 317/10666 useless extension candidates. Maximal degree in co-relation 37816. Up to 4677 conditions per place. [2023-09-01 01:12:57,529 INFO L137 encePairwiseOnDemand]: 337/343 looper letters, 143 selfloop transitions, 35 changer transitions 0/198 dead transitions. [2023-09-01 01:12:57,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 198 transitions, 1599 flow [2023-09-01 01:12:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 01:12:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 01:12:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1169 transitions. [2023-09-01 01:12:57,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868804664723032 [2023-09-01 01:12:57,533 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1169 transitions. [2023-09-01 01:12:57,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1169 transitions. [2023-09-01 01:12:57,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:57,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1169 transitions. [2023-09-01 01:12:57,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 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-09-01 01:12:57,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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-09-01 01:12:57,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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-09-01 01:12:57,542 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 701 flow. Second operand 7 states and 1169 transitions. [2023-09-01 01:12:57,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 198 transitions, 1599 flow [2023-09-01 01:12:57,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 198 transitions, 1593 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-09-01 01:12:57,679 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 812 flow [2023-09-01 01:12:57,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=812, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2023-09-01 01:12:57,679 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2023-09-01 01:12:57,679 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 812 flow [2023-09-01 01:12:57,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 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-09-01 01:12:57,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:57,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 01:12:57,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:57,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash 227973170, now seen corresponding path program 1 times [2023-09-01 01:12:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692235371] [2023-09-01 01:12:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:58,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:58,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692235371] [2023-09-01 01:12:58,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692235371] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:58,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:58,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:12:58,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307507581] [2023-09-01 01:12:58,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:58,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:12:58,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:58,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:12:58,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:12:58,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 343 [2023-09-01 01:12:58,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-09-01 01:12:58,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:58,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 343 [2023-09-01 01:12:58,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:58,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([492] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_9|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_9|, t2_funThread1of1ForFork0_#t~nondet7#1=|v_t2_funThread1of1ForFork0_#t~nondet7#1_7|, ~g~0=v_~g~0_10} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_~x~1#1, t2_funThread1of1ForFork0_#t~nondet7#1][87], [278#true, Black: 242#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 2#ULTIMATE.startEXITtrue, 118#L706true, 153#t3_funEXITtrue, Black: 265#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 201#(<= ~h~0 ~g~0), Black: 272#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, Black: 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 244#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 122#L693true, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, t2_funThread1of1ForFork0InUse, Black: 237#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 268#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 199#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 248#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 240#true, Black: 250#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 243#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0))]) [2023-09-01 01:12:58,502 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,502 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,502 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,502 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,522 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([492] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_9|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_9|, t2_funThread1of1ForFork0_#t~nondet7#1=|v_t2_funThread1of1ForFork0_#t~nondet7#1_7|, ~g~0=v_~g~0_10} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_~x~1#1, t2_funThread1of1ForFork0_#t~nondet7#1][87], [Black: 242#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 278#true, 2#ULTIMATE.startEXITtrue, 118#L706true, 153#t3_funEXITtrue, 237#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), Black: 265#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 201#(<= ~h~0 ~g~0), Black: 272#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, Black: 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 244#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 122#L693true, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 268#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 199#true, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 248#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 240#true, Black: 250#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 243#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0))]) [2023-09-01 01:12:58,522 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,522 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,522 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,522 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-09-01 01:12:58,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L719-->t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_27| 0) (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_27| |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|) (= (store |v_#pthreadsMutex_106| |v_~#B~0.base_47| (store (select |v_#pthreadsMutex_106| |v_~#B~0.base_47|) |v_~#B~0.offset_47| 0)) |v_#pthreadsMutex_105|) (= (ite (= |v_t3_funThread1of1ForFork2_~x~2#1_21| |v_t3_funThread1of1ForFork2_~y~1#1_21|) 1 0) |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_106|, ~#B~0.base=|v_~#B~0.base_47|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_21|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_21|, ~#B~0.offset=|v_~#B~0.offset_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_105|, ~#B~0.base=|v_~#B~0.base_47|, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_15|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_21|, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_27|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_21|, ~#B~0.offset=|v_~#B~0.offset_47|} AuxVars[] AssignedVars[#pthreadsMutex, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1][113], [278#true, Black: 242#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 244#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 240#true, 2#ULTIMATE.startEXITtrue, 102#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 265#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 201#(<= ~h~0 ~g~0), Black: 268#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 272#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 199#true, Black: 207#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 202#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 209#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 180#true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 220#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 227#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 122#L693true, Black: 219#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 217#true, 203#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t2_funThread1of1ForFork0InUse, Black: 237#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t_funThread1of1ForFork1InUse, 171#t2_funEXITtrue, t3_funThread1of1ForFork2InUse, 221#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 248#(and (<= ~g~0 ~h~0) (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= ~h~0 ~g~0) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 250#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)) (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 243#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0))]) [2023-09-01 01:12:58,598 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 01:12:58,598 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:58,599 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:58,599 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 01:12:58,792 INFO L130 PetriNetUnfolder]: 4027/7582 cut-off events. [2023-09-01 01:12:58,792 INFO L131 PetriNetUnfolder]: For 21471/21876 co-relation queries the response was YES. [2023-09-01 01:12:58,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26611 conditions, 7582 events. 4027/7582 cut-off events. For 21471/21876 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 59713 event pairs, 1655 based on Foata normal form. 150/7368 useless extension candidates. Maximal degree in co-relation 26584. Up to 3894 conditions per place. [2023-09-01 01:12:58,820 INFO L137 encePairwiseOnDemand]: 340/343 looper letters, 86 selfloop transitions, 2 changer transitions 1/128 dead transitions. [2023-09-01 01:12:58,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 1282 flow [2023-09-01 01:12:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:12:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:12:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-09-01 01:12:58,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849368318756074 [2023-09-01 01:12:58,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-09-01 01:12:58,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-09-01 01:12:58,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:58,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-09-01 01:12:58,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-09-01 01:12:58,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:58,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 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-09-01 01:12:58,825 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 812 flow. Second operand 3 states and 499 transitions. [2023-09-01 01:12:58,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 1282 flow [2023-09-01 01:12:58,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1211 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 01:12:58,904 INFO L231 Difference]: Finished difference. Result has 95 places, 93 transitions, 763 flow [2023-09-01 01:12:58,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2023-09-01 01:12:58,905 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2023-09-01 01:12:58,905 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 763 flow [2023-09-01 01:12:58,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-09-01 01:12:58,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:58,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:58,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 01:12:58,905 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:58,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -195281589, now seen corresponding path program 1 times [2023-09-01 01:12:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405305674] [2023-09-01 01:12:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:59,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405305674] [2023-09-01 01:12:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405305674] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:59,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:59,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:12:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483703366] [2023-09-01 01:12:59,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:59,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 01:12:59,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:59,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 01:12:59,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 01:12:59,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 343 [2023-09-01 01:12:59,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 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-09-01 01:12:59,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:59,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 343 [2023-09-01 01:12:59,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:12:59,474 INFO L130 PetriNetUnfolder]: 1612/3432 cut-off events. [2023-09-01 01:12:59,475 INFO L131 PetriNetUnfolder]: For 9386/9587 co-relation queries the response was YES. [2023-09-01 01:12:59,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12299 conditions, 3432 events. 1612/3432 cut-off events. For 9386/9587 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 24770 event pairs, 339 based on Foata normal form. 543/3876 useless extension candidates. Maximal degree in co-relation 12272. Up to 2146 conditions per place. [2023-09-01 01:12:59,494 INFO L137 encePairwiseOnDemand]: 333/343 looper letters, 60 selfloop transitions, 17 changer transitions 4/106 dead transitions. [2023-09-01 01:12:59,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 962 flow [2023-09-01 01:12:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:12:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:12:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 639 transitions. [2023-09-01 01:12:59,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46574344023323616 [2023-09-01 01:12:59,497 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 639 transitions. [2023-09-01 01:12:59,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 639 transitions. [2023-09-01 01:12:59,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:12:59,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 639 transitions. [2023-09-01 01:12:59,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 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-09-01 01:12:59,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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-09-01 01:12:59,501 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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-09-01 01:12:59,501 INFO L175 Difference]: Start difference. First operand has 95 places, 93 transitions, 763 flow. Second operand 4 states and 639 transitions. [2023-09-01 01:12:59,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 962 flow [2023-09-01 01:12:59,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 106 transitions, 934 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-09-01 01:12:59,542 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 678 flow [2023-09-01 01:12:59,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=678, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2023-09-01 01:12:59,543 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2023-09-01 01:12:59,543 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 678 flow [2023-09-01 01:12:59,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 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-09-01 01:12:59,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:12:59,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:12:59,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 01:12:59,544 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:12:59,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:12:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2532345, now seen corresponding path program 1 times [2023-09-01 01:12:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:12:59,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904234726] [2023-09-01 01:12:59,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:12:59,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:12:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:12:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:12:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:12:59,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904234726] [2023-09-01 01:12:59,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904234726] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:12:59,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:12:59,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 01:12:59,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706217632] [2023-09-01 01:12:59,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:12:59,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:12:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:12:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:12:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:12:59,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 343 [2023-09-01 01:12:59,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 678 flow. Second operand has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 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-09-01 01:12:59,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:12:59,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 343 [2023-09-01 01:12:59,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:00,153 INFO L130 PetriNetUnfolder]: 1392/3113 cut-off events. [2023-09-01 01:13:00,153 INFO L131 PetriNetUnfolder]: For 7924/8122 co-relation queries the response was YES. [2023-09-01 01:13:00,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11200 conditions, 3113 events. 1392/3113 cut-off events. For 7924/8122 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 23660 event pairs, 228 based on Foata normal form. 170/3225 useless extension candidates. Maximal degree in co-relation 11175. Up to 1119 conditions per place. [2023-09-01 01:13:00,166 INFO L137 encePairwiseOnDemand]: 335/343 looper letters, 136 selfloop transitions, 39 changer transitions 11/204 dead transitions. [2023-09-01 01:13:00,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 1700 flow [2023-09-01 01:13:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 01:13:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 01:13:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2098 transitions. [2023-09-01 01:13:00,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47050908275398073 [2023-09-01 01:13:00,170 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2098 transitions. [2023-09-01 01:13:00,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2098 transitions. [2023-09-01 01:13:00,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:00,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2098 transitions. [2023-09-01 01:13:00,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 161.3846153846154) internal successors, (2098), 13 states have internal predecessors, (2098), 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-09-01 01:13:00,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 343.0) internal successors, (4802), 14 states have internal predecessors, (4802), 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-09-01 01:13:00,179 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 343.0) internal successors, (4802), 14 states have internal predecessors, (4802), 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-09-01 01:13:00,180 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 678 flow. Second operand 13 states and 2098 transitions. [2023-09-01 01:13:00,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 204 transitions, 1700 flow [2023-09-01 01:13:00,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 204 transitions, 1627 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 01:13:00,210 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 844 flow [2023-09-01 01:13:00,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=844, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2023-09-01 01:13:00,210 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2023-09-01 01:13:00,211 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 844 flow [2023-09-01 01:13:00,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 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-09-01 01:13:00,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:00,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:00,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 01:13:00,211 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:13:00,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1131192569, now seen corresponding path program 1 times [2023-09-01 01:13:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026292057] [2023-09-01 01:13:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026292057] [2023-09-01 01:13:00,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026292057] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:00,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:00,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 01:13:00,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138464534] [2023-09-01 01:13:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:00,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:00,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:00,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:00,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 343 [2023-09-01 01:13:00,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 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-09-01 01:13:00,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:00,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 343 [2023-09-01 01:13:00,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:00,969 INFO L130 PetriNetUnfolder]: 1594/3597 cut-off events. [2023-09-01 01:13:00,969 INFO L131 PetriNetUnfolder]: For 13260/13625 co-relation queries the response was YES. [2023-09-01 01:13:00,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14044 conditions, 3597 events. 1594/3597 cut-off events. For 13260/13625 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 28222 event pairs, 341 based on Foata normal form. 205/3755 useless extension candidates. Maximal degree in co-relation 14015. Up to 1422 conditions per place. [2023-09-01 01:13:00,985 INFO L137 encePairwiseOnDemand]: 335/343 looper letters, 141 selfloop transitions, 32 changer transitions 28/220 dead transitions. [2023-09-01 01:13:00,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 220 transitions, 2175 flow [2023-09-01 01:13:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 01:13:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 01:13:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2071 transitions. [2023-09-01 01:13:00,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644539134335053 [2023-09-01 01:13:00,989 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2071 transitions. [2023-09-01 01:13:00,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2071 transitions. [2023-09-01 01:13:00,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:00,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2071 transitions. [2023-09-01 01:13:00,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 159.30769230769232) internal successors, (2071), 13 states have internal predecessors, (2071), 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-09-01 01:13:00,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 343.0) internal successors, (4802), 14 states have internal predecessors, (4802), 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-09-01 01:13:00,999 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 343.0) internal successors, (4802), 14 states have internal predecessors, (4802), 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-09-01 01:13:00,999 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 844 flow. Second operand 13 states and 2071 transitions. [2023-09-01 01:13:00,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 220 transitions, 2175 flow [2023-09-01 01:13:01,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 220 transitions, 2039 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-09-01 01:13:01,038 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 850 flow [2023-09-01 01:13:01,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=850, PETRI_PLACES=112, PETRI_TRANSITIONS=96} [2023-09-01 01:13:01,039 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places. [2023-09-01 01:13:01,039 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 850 flow [2023-09-01 01:13:01,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 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-09-01 01:13:01,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:01,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:01,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 01:13:01,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:13:01,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -255764930, now seen corresponding path program 1 times [2023-09-01 01:13:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596301697] [2023-09-01 01:13:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596301697] [2023-09-01 01:13:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596301697] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:01,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:01,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 01:13:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358709840] [2023-09-01 01:13:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:01,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 01:13:01,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 01:13:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 01:13:01,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 343 [2023-09-01 01:13:01,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 850 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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-09-01 01:13:01,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:01,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 343 [2023-09-01 01:13:01,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:01,404 INFO L130 PetriNetUnfolder]: 413/1287 cut-off events. [2023-09-01 01:13:01,404 INFO L131 PetriNetUnfolder]: For 2587/2657 co-relation queries the response was YES. [2023-09-01 01:13:01,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4554 conditions, 1287 events. 413/1287 cut-off events. For 2587/2657 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8967 event pairs, 170 based on Foata normal form. 77/1364 useless extension candidates. Maximal degree in co-relation 4524. Up to 681 conditions per place. [2023-09-01 01:13:01,410 INFO L137 encePairwiseOnDemand]: 332/343 looper letters, 36 selfloop transitions, 13 changer transitions 14/75 dead transitions. [2023-09-01 01:13:01,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 75 transitions, 675 flow [2023-09-01 01:13:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:13:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:13:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 627 transitions. [2023-09-01 01:13:01,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45699708454810495 [2023-09-01 01:13:01,412 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 627 transitions. [2023-09-01 01:13:01,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 627 transitions. [2023-09-01 01:13:01,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:01,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 627 transitions. [2023-09-01 01:13:01,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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-09-01 01:13:01,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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-09-01 01:13:01,415 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 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-09-01 01:13:01,415 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 850 flow. Second operand 4 states and 627 transitions. [2023-09-01 01:13:01,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 75 transitions, 675 flow [2023-09-01 01:13:01,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 75 transitions, 568 flow, removed 14 selfloop flow, removed 19 redundant places. [2023-09-01 01:13:01,426 INFO L231 Difference]: Finished difference. Result has 90 places, 54 transitions, 339 flow [2023-09-01 01:13:01,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=90, PETRI_TRANSITIONS=54} [2023-09-01 01:13:01,426 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2023-09-01 01:13:01,426 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 54 transitions, 339 flow [2023-09-01 01:13:01,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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-09-01 01:13:01,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:01,427 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] [2023-09-01 01:13:01,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 01:13:01,427 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-09-01 01:13:01,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash 617988669, now seen corresponding path program 1 times [2023-09-01 01:13:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924885527] [2023-09-01 01:13:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:01,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:01,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924885527] [2023-09-01 01:13:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924885527] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:01,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 01:13:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971209189] [2023-09-01 01:13:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:01,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:01,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:01,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 343 [2023-09-01 01:13:01,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 54 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 153.66666666666666) internal successors, (922), 6 states have internal predecessors, (922), 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-09-01 01:13:01,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:01,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 343 [2023-09-01 01:13:01,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:01,794 INFO L130 PetriNetUnfolder]: 227/719 cut-off events. [2023-09-01 01:13:01,794 INFO L131 PetriNetUnfolder]: For 1074/1112 co-relation queries the response was YES. [2023-09-01 01:13:01,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 719 events. 227/719 cut-off events. For 1074/1112 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4168 event pairs, 107 based on Foata normal form. 34/744 useless extension candidates. Maximal degree in co-relation 2331. Up to 288 conditions per place. [2023-09-01 01:13:01,796 INFO L137 encePairwiseOnDemand]: 337/343 looper letters, 0 selfloop transitions, 0 changer transitions 76/76 dead transitions. [2023-09-01 01:13:01,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 550 flow [2023-09-01 01:13:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 01:13:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 01:13:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1108 transitions. [2023-09-01 01:13:01,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614743856726364 [2023-09-01 01:13:01,799 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1108 transitions. [2023-09-01 01:13:01,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1108 transitions. [2023-09-01 01:13:01,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:01,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1108 transitions. [2023-09-01 01:13:01,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.28571428571428) internal successors, (1108), 7 states have internal predecessors, (1108), 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-09-01 01:13:01,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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-09-01 01:13:01,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 343.0) internal successors, (2744), 8 states have internal predecessors, (2744), 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-09-01 01:13:01,805 INFO L175 Difference]: Start difference. First operand has 90 places, 54 transitions, 339 flow. Second operand 7 states and 1108 transitions. [2023-09-01 01:13:01,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 550 flow [2023-09-01 01:13:01,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 490 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-09-01 01:13:01,808 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2023-09-01 01:13:01,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2023-09-01 01:13:01,809 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2023-09-01 01:13:01,809 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2023-09-01 01:13:01,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.66666666666666) internal successors, (922), 6 states have internal predecessors, (922), 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-09-01 01:13:01,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-09-01 01:13:01,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-09-01 01:13:01,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-09-01 01:13:01,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-09-01 01:13:01,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-09-01 01:13:01,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-09-01 01:13:01,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-09-01 01:13:01,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-09-01 01:13:01,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2023-09-01 01:13:01,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2023-09-01 01:13:01,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-09-01 01:13:01,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-09-01 01:13:01,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-09-01 01:13:01,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-09-01 01:13:01,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 16 remaining) [2023-09-01 01:13:01,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-09-01 01:13:01,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 01:13:01,814 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:01,819 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 01:13:01,819 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 01:13:01,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 01:13:01 BasicIcfg [2023-09-01 01:13:01,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 01:13:01,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 01:13:01,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 01:13:01,822 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 01:13:01,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:12:43" (3/4) ... [2023-09-01 01:13:01,824 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-09-01 01:13:01,829 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2023-09-01 01:13:01,829 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2023-09-01 01:13:01,829 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2023-09-01 01:13:01,833 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2023-09-01 01:13:01,833 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-09-01 01:13:01,833 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-09-01 01:13:01,834 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-09-01 01:13:01,861 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 01:13:01,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 01:13:01,862 INFO L158 Benchmark]: Toolchain (without parser) took 19780.95ms. Allocated memory was 73.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 49.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 175.4MB. Max. memory is 16.1GB. [2023-09-01 01:13:01,862 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 01:13:01,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.54ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 47.6MB in the end (delta: 1.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-09-01 01:13:01,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.26ms. Allocated memory is still 73.4MB. Free memory was 47.6MB in the beginning and 45.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 01:13:01,863 INFO L158 Benchmark]: Boogie Preprocessor took 25.72ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 43.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 01:13:01,863 INFO L158 Benchmark]: RCFGBuilder took 457.47ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 43.7MB in the beginning and 65.9MB in the end (delta: -22.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-09-01 01:13:01,863 INFO L158 Benchmark]: TraceAbstraction took 18740.03ms. Allocated memory was 94.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 65.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. [2023-09-01 01:13:01,864 INFO L158 Benchmark]: Witness Printer took 39.85ms. Allocated memory is still 1.9GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 01:13:01,865 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.18ms. Allocated memory is still 73.4MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.54ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 47.6MB in the end (delta: 1.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.26ms. Allocated memory is still 73.4MB. Free memory was 47.6MB in the beginning and 45.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.72ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 43.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 457.47ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 43.7MB in the beginning and 65.9MB in the end (delta: -22.3MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18740.03ms. Allocated memory was 94.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 65.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. * Witness Printer took 39.85ms. Allocated memory is still 1.9GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 174 PlacesBefore, 54 PlacesAfterwards, 169 TransitionsBefore, 46 TransitionsAfterwards, 9966 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 102 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 171 TotalNumberOfCompositions, 21593 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11280, independent: 10907, independent conditional: 0, independent unconditional: 10907, dependent: 373, dependent conditional: 0, dependent unconditional: 373, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5499, independent: 5435, independent conditional: 0, independent unconditional: 5435, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11280, independent: 5472, independent conditional: 0, independent unconditional: 5472, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 5499, unknown conditional: 0, unknown unconditional: 5499] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 200, Positive conditional cache size: 0, Positive unconditional cache size: 200, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 19]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 723]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 243 locations, 16 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: 18.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1636 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1185 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3032 IncrementalHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 144 mSDtfsCounter, 3032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=14, InterpolantAutomatonStates: 92, 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, 1.6s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-09-01 01:13:01,883 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE