./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8 --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 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:41:50,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:41:50,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:41:50,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:41:50,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:41:50,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:41:50,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:41:50,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:41:50,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:41:50,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:41:50,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:41:50,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:41:50,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:41:50,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:41:50,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:41:50,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:41:50,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:41:50,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:41:50,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:41:50,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:41:50,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:41:50,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:41:50,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:41:50,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:41:50,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:41:50,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:41:50,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:41:50,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:41:50,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:41:50,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:41:50,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:41:50,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:41:50,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:41:50,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:41:50,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:41:50,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:41:50,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:41:50,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:41:50,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:41:50,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:41:50,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:41:50,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 21:41:50,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:41:50,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:41:50,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:41:50,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:41:50,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:41:50,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:41:50,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:41:50,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:41:50,278 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:41:50,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:41:50,278 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:41:50,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:41:50,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:41:50,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:41:50,280 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:41:50,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:41:50,281 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:41:50,281 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8 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 [2022-12-13 21:41:50,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:41:50,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:41:50,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:41:50,467 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:41:50,468 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:41:50,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-12-13 21:41:53,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:41:53,176 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:41:53,176 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-12-13 21:41:53,185 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/data/846b53db1/56847ff8273b492bb664df3f7976273c/FLAG4d322fa55 [2022-12-13 21:41:53,196 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/data/846b53db1/56847ff8273b492bb664df3f7976273c [2022-12-13 21:41:53,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:41:53,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:41:53,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:41:53,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:41:53,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:41:53,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6defb106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53, skipping insertion in model container [2022-12-13 21:41:53,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:41:53,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:41:53,346 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2022-12-13 21:41:53,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:41:53,451 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:41:53,460 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2022-12-13 21:41:53,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:41:53,506 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:41:53,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53 WrapperNode [2022-12-13 21:41:53,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:41:53,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:41:53,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:41:53,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:41:53,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,548 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2022-12-13 21:41:53,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:41:53,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:41:53,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:41:53,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:41:53,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,569 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:41:53,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:41:53,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:41:53,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:41:53,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (1/1) ... [2022-12-13 21:41:53,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:41:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:41:53,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:41:53,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:41:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-13 21:41:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-13 21:41:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:41:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 21:41:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:41:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:41:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2022-12-13 21:41:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2022-12-13 21:41:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 21:41:53,637 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 21:41:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:41:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:41:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:41:53,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:41:53,638 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 21:41:53,739 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:41:53,740 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:41:53,949 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:41:53,957 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:41:53,957 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:41:53,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:41:53 BoogieIcfgContainer [2022-12-13 21:41:53,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:41:53,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:41:53,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:41:53,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:41:53,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:41:53" (1/3) ... [2022-12-13 21:41:53,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1656f54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:41:53, skipping insertion in model container [2022-12-13 21:41:53,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:41:53" (2/3) ... [2022-12-13 21:41:53,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1656f54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:41:53, skipping insertion in model container [2022-12-13 21:41:53,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:41:53" (3/3) ... [2022-12-13 21:41:53,968 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2022-12-13 21:41:53,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:41:53,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 21:41:53,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:41:54,057 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:41:54,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 177 transitions, 369 flow [2022-12-13 21:41:54,132 INFO L130 PetriNetUnfolder]: 5/174 cut-off events. [2022-12-13 21:41:54,132 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:41:54,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 174 events. 5/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 283 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 21:41:54,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 177 transitions, 369 flow [2022-12-13 21:41:54,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 174 transitions, 357 flow [2022-12-13 21:41:54,151 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:41:54,160 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 174 transitions, 357 flow [2022-12-13 21:41:54,162 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 174 transitions, 357 flow [2022-12-13 21:41:54,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 174 transitions, 357 flow [2022-12-13 21:41:54,199 INFO L130 PetriNetUnfolder]: 5/174 cut-off events. [2022-12-13 21:41:54,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:41:54,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 174 events. 5/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 283 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 21:41:54,204 INFO L119 LiptonReduction]: Number of co-enabled transitions 10466 [2022-12-13 21:41:58,909 INFO L134 LiptonReduction]: Checked pairs total: 21435 [2022-12-13 21:41:58,909 INFO L136 LiptonReduction]: Total number of compositions: 175 [2022-12-13 21:41:58,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:41:58,924 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;@9f8e8b8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:41:58,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 21:41:58,925 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 21:41:58,925 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:41:58,925 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:58,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 21:41:58,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:41:58,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash 654, now seen corresponding path program 1 times [2022-12-13 21:41:58,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:41:58,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471866185] [2022-12-13 21:41:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:41:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:41:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:41:59,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471866185] [2022-12-13 21:41:59,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471866185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:59,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:59,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 21:41:59,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192145382] [2022-12-13 21:41:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:59,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:41:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:41:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:41:59,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:41:59,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 352 [2022-12-13 21:41:59,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 101 flow. Second operand has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:59,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:59,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 352 [2022-12-13 21:41:59,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:41:59,472 INFO L130 PetriNetUnfolder]: 3606/5372 cut-off events. [2022-12-13 21:41:59,472 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 21:41:59,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10516 conditions, 5372 events. 3606/5372 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 32259 event pairs, 3312 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 10505. Up to 5078 conditions per place. [2022-12-13 21:41:59,506 INFO L137 encePairwiseOnDemand]: 349/352 looper letters, 32 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2022-12-13 21:41:59,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 157 flow [2022-12-13 21:41:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:41:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 21:41:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2022-12-13 21:41:59,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5213068181818182 [2022-12-13 21:41:59,519 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 367 transitions. [2022-12-13 21:41:59,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 367 transitions. [2022-12-13 21:41:59,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:41:59,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 367 transitions. [2022-12-13 21:41:59,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:59,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:59,529 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:59,531 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 101 flow. Second operand 2 states and 367 transitions. [2022-12-13 21:41:59,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 157 flow [2022-12-13 21:41:59,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:41:59,535 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 90 flow [2022-12-13 21:41:59,536 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-12-13 21:41:59,539 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2022-12-13 21:41:59,539 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 90 flow [2022-12-13 21:41:59,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:59,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:41:59,540 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:41:59,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:41:59,540 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)] === [2022-12-13 21:41:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:41:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 643928, now seen corresponding path program 1 times [2022-12-13 21:41:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:41:59,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228898706] [2022-12-13 21:41:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:41:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:41:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:41:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:41:59,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:41:59,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228898706] [2022-12-13 21:41:59,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228898706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:41:59,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:41:59,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:41:59,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012533780] [2022-12-13 21:41:59,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:41:59,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:41:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:41:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:41:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:41:59,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 352 [2022-12-13 21:41:59,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:41:59,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:41:59,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 352 [2022-12-13 21:41:59,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:00,215 INFO L130 PetriNetUnfolder]: 3601/5357 cut-off events. [2022-12-13 21:42:00,215 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:42:00,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10489 conditions, 5357 events. 3601/5357 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 32176 event pairs, 2578 based on Foata normal form. 0/3947 useless extension candidates. Maximal degree in co-relation 10486. Up to 3977 conditions per place. [2022-12-13 21:42:00,235 INFO L137 encePairwiseOnDemand]: 348/352 looper letters, 42 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2022-12-13 21:42:00,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 206 flow [2022-12-13 21:42:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:42:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:42:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-12-13 21:42:00,239 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2022-12-13 21:42:00,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-12-13 21:42:00,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-12-13 21:42:00,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:00,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-12-13 21:42:00,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,244 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 90 flow. Second operand 3 states and 520 transitions. [2022-12-13 21:42:00,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 206 flow [2022-12-13 21:42:00,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:42:00,245 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 94 flow [2022-12-13 21:42:00,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, 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} [2022-12-13 21:42:00,245 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2022-12-13 21:42:00,246 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 94 flow [2022-12-13 21:42:00,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:00,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:42:00,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:42:00,246 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)] === [2022-12-13 21:42:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 643927, now seen corresponding path program 1 times [2022-12-13 21:42:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:00,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477127745] [2022-12-13 21:42:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477127745] [2022-12-13 21:42:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477127745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:00,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:00,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:42:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080429222] [2022-12-13 21:42:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:00,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:42:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:42:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:42:00,366 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 352 [2022-12-13 21:42:00,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:00,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 352 [2022-12-13 21:42:00,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:00,811 INFO L130 PetriNetUnfolder]: 3596/5342 cut-off events. [2022-12-13 21:42:00,811 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:42:00,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10766 conditions, 5342 events. 3596/5342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 32120 event pairs, 2574 based on Foata normal form. 0/4088 useless extension candidates. Maximal degree in co-relation 10762. Up to 3967 conditions per place. [2022-12-13 21:42:00,838 INFO L137 encePairwiseOnDemand]: 348/352 looper letters, 41 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2022-12-13 21:42:00,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 208 flow [2022-12-13 21:42:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:42:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:42:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2022-12-13 21:42:00,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5028409090909091 [2022-12-13 21:42:00,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2022-12-13 21:42:00,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2022-12-13 21:42:00,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:00,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2022-12-13 21:42:00,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,844 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 94 flow. Second operand 3 states and 531 transitions. [2022-12-13 21:42:00,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 208 flow [2022-12-13 21:42:00,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:42:00,859 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 92 flow [2022-12-13 21:42:00,859 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, 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} [2022-12-13 21:42:00,860 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2022-12-13 21:42:00,860 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 92 flow [2022-12-13 21:42:00,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:00,860 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:42:00,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:42:00,861 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)] === [2022-12-13 21:42:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 618827282, now seen corresponding path program 1 times [2022-12-13 21:42:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:00,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523855892] [2022-12-13 21:42:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:00,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523855892] [2022-12-13 21:42:00,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523855892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:00,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:00,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:42:00,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679547367] [2022-12-13 21:42:00,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:00,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:42:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:00,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:42:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:42:00,946 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 352 [2022-12-13 21:42:00,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:00,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:00,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 352 [2022-12-13 21:42:00,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:01,323 INFO L130 PetriNetUnfolder]: 3551/5267 cut-off events. [2022-12-13 21:42:01,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:42:01,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10621 conditions, 5267 events. 3551/5267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 31588 event pairs, 2534 based on Foata normal form. 0/4050 useless extension candidates. Maximal degree in co-relation 10617. Up to 3897 conditions per place. [2022-12-13 21:42:01,348 INFO L137 encePairwiseOnDemand]: 348/352 looper letters, 40 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 21:42:01,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 204 flow [2022-12-13 21:42:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:42:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:42:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-12-13 21:42:01,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49053030303030304 [2022-12-13 21:42:01,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-12-13 21:42:01,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-12-13 21:42:01,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:01,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-12-13 21:42:01,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,355 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 92 flow. Second operand 3 states and 518 transitions. [2022-12-13 21:42:01,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 204 flow [2022-12-13 21:42:01,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:42:01,367 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 90 flow [2022-12-13 21:42:01,367 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, 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} [2022-12-13 21:42:01,368 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2022-12-13 21:42:01,368 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 90 flow [2022-12-13 21:42:01,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,369 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:01,369 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 21:42:01,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:42:01,369 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)] === [2022-12-13 21:42:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash 618827281, now seen corresponding path program 1 times [2022-12-13 21:42:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:01,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947074282] [2022-12-13 21:42:01,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:01,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:01,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947074282] [2022-12-13 21:42:01,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947074282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:01,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:01,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:42:01,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303400784] [2022-12-13 21:42:01,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:01,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:42:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:42:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:42:01,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 352 [2022-12-13 21:42:01,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:01,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 352 [2022-12-13 21:42:01,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:01,866 INFO L130 PetriNetUnfolder]: 3506/5192 cut-off events. [2022-12-13 21:42:01,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:42:01,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10476 conditions, 5192 events. 3506/5192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 30985 event pairs, 2494 based on Foata normal form. 0/4012 useless extension candidates. Maximal degree in co-relation 10472. Up to 3827 conditions per place. [2022-12-13 21:42:01,886 INFO L137 encePairwiseOnDemand]: 348/352 looper letters, 39 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-12-13 21:42:01,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 200 flow [2022-12-13 21:42:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:42:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:42:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2022-12-13 21:42:01,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5009469696969697 [2022-12-13 21:42:01,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2022-12-13 21:42:01,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2022-12-13 21:42:01,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:01,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2022-12-13 21:42:01,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,892 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 90 flow. Second operand 3 states and 529 transitions. [2022-12-13 21:42:01,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 200 flow [2022-12-13 21:42:01,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:42:01,901 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 88 flow [2022-12-13 21:42:01,902 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 21:42:01,902 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-12-13 21:42:01,902 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 88 flow [2022-12-13 21:42:01,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:01,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:01,903 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:01,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:42:01,903 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)] === [2022-12-13 21:42:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1485432403, now seen corresponding path program 1 times [2022-12-13 21:42:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:01,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003098654] [2022-12-13 21:42:01,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:01,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003098654] [2022-12-13 21:42:01,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003098654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:01,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:01,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:42:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775269642] [2022-12-13 21:42:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:01,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:42:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:42:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:42:02,015 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 352 [2022-12-13 21:42:02,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:02,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:02,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 352 [2022-12-13 21:42:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:02,777 INFO L130 PetriNetUnfolder]: 5968/9075 cut-off events. [2022-12-13 21:42:02,777 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-12-13 21:42:02,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18229 conditions, 9075 events. 5968/9075 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 59878 event pairs, 1135 based on Foata normal form. 0/7487 useless extension candidates. Maximal degree in co-relation 18225. Up to 3821 conditions per place. [2022-12-13 21:42:02,800 INFO L137 encePairwiseOnDemand]: 345/352 looper letters, 130 selfloop transitions, 10 changer transitions 0/148 dead transitions. [2022-12-13 21:42:02,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 148 transitions, 626 flow [2022-12-13 21:42:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:42:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:42:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1399 transitions. [2022-12-13 21:42:02,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4968039772727273 [2022-12-13 21:42:02,803 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1399 transitions. [2022-12-13 21:42:02,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1399 transitions. [2022-12-13 21:42:02,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:02,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1399 transitions. [2022-12-13 21:42:02,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 174.875) internal successors, (1399), 8 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:02,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:02,809 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:02,809 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 88 flow. Second operand 8 states and 1399 transitions. [2022-12-13 21:42:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 148 transitions, 626 flow [2022-12-13 21:42:02,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 148 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:42:02,814 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 151 flow [2022-12-13 21:42:02,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-13 21:42:02,814 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2022-12-13 21:42:02,814 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 151 flow [2022-12-13 21:42:02,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:02,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:02,815 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:02,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:42:02,815 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)] === [2022-12-13 21:42:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 496558952, now seen corresponding path program 1 times [2022-12-13 21:42:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309583714] [2022-12-13 21:42:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:02,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309583714] [2022-12-13 21:42:02,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309583714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:02,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:02,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:42:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086662823] [2022-12-13 21:42:02,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:02,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:42:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:42:02,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:42:02,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 352 [2022-12-13 21:42:02,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:02,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:02,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 352 [2022-12-13 21:42:02,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:03,766 INFO L130 PetriNetUnfolder]: 7361/11083 cut-off events. [2022-12-13 21:42:03,767 INFO L131 PetriNetUnfolder]: For 6836/7247 co-relation queries the response was YES. [2022-12-13 21:42:03,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27333 conditions, 11083 events. 7361/11083 cut-off events. For 6836/7247 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 72373 event pairs, 1125 based on Foata normal form. 171/9735 useless extension candidates. Maximal degree in co-relation 27324. Up to 3686 conditions per place. [2022-12-13 21:42:03,811 INFO L137 encePairwiseOnDemand]: 345/352 looper letters, 113 selfloop transitions, 20 changer transitions 0/142 dead transitions. [2022-12-13 21:42:03,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 142 transitions, 725 flow [2022-12-13 21:42:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:42:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:42:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1366 transitions. [2022-12-13 21:42:03,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4850852272727273 [2022-12-13 21:42:03,817 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1366 transitions. [2022-12-13 21:42:03,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1366 transitions. [2022-12-13 21:42:03,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:03,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1366 transitions. [2022-12-13 21:42:03,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.75) internal successors, (1366), 8 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:03,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:03,827 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:03,827 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 151 flow. Second operand 8 states and 1366 transitions. [2022-12-13 21:42:03,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 142 transitions, 725 flow [2022-12-13 21:42:03,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 142 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:42:03,896 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 328 flow [2022-12-13 21:42:03,896 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, 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} [2022-12-13 21:42:03,897 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2022-12-13 21:42:03,897 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 328 flow [2022-12-13 21:42:03,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:03,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:03,898 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:03,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:42:03,898 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)] === [2022-12-13 21:42:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1069191396, now seen corresponding path program 1 times [2022-12-13 21:42:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:03,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941354570] [2022-12-13 21:42:03,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:03,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:03,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:03,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941354570] [2022-12-13 21:42:03,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941354570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:03,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:03,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:42:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667915279] [2022-12-13 21:42:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:42:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:03,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:42:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:42:04,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 352 [2022-12-13 21:42:04,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:04,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:04,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 352 [2022-12-13 21:42:04,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:04,656 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, 47#L736true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,656 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,656 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,656 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,656 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,657 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, 47#L736true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,657 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,657 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,657 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,657 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,707 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, 47#L736true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,707 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,707 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,707 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,707 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,707 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,707 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, 47#L736true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,708 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,708 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,708 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,708 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,708 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 21:42:04,716 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 129#L737-2true, 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,716 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,716 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,716 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,716 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,716 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 129#L737-2true, 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,716 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,716 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,716 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,717 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,761 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 129#L737-2true, 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,761 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,761 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,761 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,761 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,761 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,761 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 129#L737-2true, 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,761 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,761 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [42#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,768 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 2#ULTIMATE.startEXITtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,768 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,768 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,769 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [42#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,769 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 2#ULTIMATE.startEXITtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,770 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,770 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,770 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,770 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,770 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, 176#t2_funEXITtrue, 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,770 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,770 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,770 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,770 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,810 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [42#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,811 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 2#ULTIMATE.startEXITtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,811 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,811 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, 156#t3_funEXITtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,812 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [42#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, 240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,812 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,812 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 2#ULTIMATE.startEXITtrue, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,813 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][69], [240#true, 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 222#true, Black: 232#(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|)), 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork1InUse, 185#true, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 176#t2_funEXITtrue, Black: 204#true, 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|))]) [2022-12-13 21:42:04,813 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,813 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 21:42:04,895 INFO L130 PetriNetUnfolder]: 6524/10998 cut-off events. [2022-12-13 21:42:04,895 INFO L131 PetriNetUnfolder]: For 8091/8458 co-relation queries the response was YES. [2022-12-13 21:42:04,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27813 conditions, 10998 events. 6524/10998 cut-off events. For 8091/8458 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 80175 event pairs, 2858 based on Foata normal form. 1203/10262 useless extension candidates. Maximal degree in co-relation 27798. Up to 6297 conditions per place. [2022-12-13 21:42:04,933 INFO L137 encePairwiseOnDemand]: 337/352 looper letters, 59 selfloop transitions, 17 changer transitions 0/93 dead transitions. [2022-12-13 21:42:04,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 600 flow [2022-12-13 21:42:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:42:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:42:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-12-13 21:42:04,935 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2022-12-13 21:42:04,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-12-13 21:42:04,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-12-13 21:42:04,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:04,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-12-13 21:42:04,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:04,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:04,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:04,938 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 328 flow. Second operand 3 states and 520 transitions. [2022-12-13 21:42:04,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 600 flow [2022-12-13 21:42:05,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 93 transitions, 596 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 21:42:05,021 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 423 flow [2022-12-13 21:42:05,021 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, 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=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2022-12-13 21:42:05,021 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2022-12-13 21:42:05,021 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 423 flow [2022-12-13 21:42:05,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:05,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:05,022 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:05,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:42:05,022 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)] === [2022-12-13 21:42:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1952389202, now seen corresponding path program 1 times [2022-12-13 21:42:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:05,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768643623] [2022-12-13 21:42:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:05,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:05,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:05,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768643623] [2022-12-13 21:42:05,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768643623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:05,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:05,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:42:05,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967688678] [2022-12-13 21:42:05,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:05,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:42:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:42:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:42:05,133 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 352 [2022-12-13 21:42:05,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 423 flow. Second operand has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:05,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:05,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 352 [2022-12-13 21:42:05,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:06,117 INFO L130 PetriNetUnfolder]: 6642/11188 cut-off events. [2022-12-13 21:42:06,117 INFO L131 PetriNetUnfolder]: For 15933/16402 co-relation queries the response was YES. [2022-12-13 21:42:06,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36267 conditions, 11188 events. 6642/11188 cut-off events. For 15933/16402 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 79136 event pairs, 1521 based on Foata normal form. 173/9635 useless extension candidates. Maximal degree in co-relation 36250. Up to 4569 conditions per place. [2022-12-13 21:42:06,155 INFO L137 encePairwiseOnDemand]: 345/352 looper letters, 133 selfloop transitions, 31 changer transitions 0/180 dead transitions. [2022-12-13 21:42:06,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 180 transitions, 1333 flow [2022-12-13 21:42:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:42:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:42:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1366 transitions. [2022-12-13 21:42:06,158 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4850852272727273 [2022-12-13 21:42:06,158 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1366 transitions. [2022-12-13 21:42:06,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1366 transitions. [2022-12-13 21:42:06,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:06,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1366 transitions. [2022-12-13 21:42:06,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.75) internal successors, (1366), 8 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:06,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:06,163 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 352.0) internal successors, (3168), 9 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:06,163 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 423 flow. Second operand 8 states and 1366 transitions. [2022-12-13 21:42:06,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 180 transitions, 1333 flow [2022-12-13 21:42:06,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 180 transitions, 1283 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:42:06,245 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 713 flow [2022-12-13 21:42:06,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2022-12-13 21:42:06,245 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 32 predicate places. [2022-12-13 21:42:06,245 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 713 flow [2022-12-13 21:42:06,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:06,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:06,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:06,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:42:06,246 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)] === [2022-12-13 21:42:06,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2108825861, now seen corresponding path program 1 times [2022-12-13 21:42:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:06,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903921869] [2022-12-13 21:42:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:06,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903921869] [2022-12-13 21:42:06,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903921869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:06,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:06,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:42:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48777921] [2022-12-13 21:42:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:06,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:42:06,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:42:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:42:06,363 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 352 [2022-12-13 21:42:06,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:06,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:06,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 352 [2022-12-13 21:42:06,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:07,988 INFO L130 PetriNetUnfolder]: 8512/14085 cut-off events. [2022-12-13 21:42:07,988 INFO L131 PetriNetUnfolder]: For 30393/30624 co-relation queries the response was YES. [2022-12-13 21:42:08,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46964 conditions, 14085 events. 8512/14085 cut-off events. For 30393/30624 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 100512 event pairs, 2049 based on Foata normal form. 415/12612 useless extension candidates. Maximal degree in co-relation 46942. Up to 5808 conditions per place. [2022-12-13 21:42:08,062 INFO L137 encePairwiseOnDemand]: 346/352 looper letters, 170 selfloop transitions, 35 changer transitions 0/221 dead transitions. [2022-12-13 21:42:08,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 221 transitions, 1781 flow [2022-12-13 21:42:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:42:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:42:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1216 transitions. [2022-12-13 21:42:08,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2022-12-13 21:42:08,065 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1216 transitions. [2022-12-13 21:42:08,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1216 transitions. [2022-12-13 21:42:08,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:08,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1216 transitions. [2022-12-13 21:42:08,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.71428571428572) internal successors, (1216), 7 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:08,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:08,070 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:08,070 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 713 flow. Second operand 7 states and 1216 transitions. [2022-12-13 21:42:08,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 221 transitions, 1781 flow [2022-12-13 21:42:08,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 221 transitions, 1775 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 21:42:08,285 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 824 flow [2022-12-13 21:42:08,286 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=824, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2022-12-13 21:42:08,286 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2022-12-13 21:42:08,286 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 824 flow [2022-12-13 21:42:08,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:08,286 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:08,286 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:08,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:42:08,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:42:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1118892125, now seen corresponding path program 1 times [2022-12-13 21:42:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:08,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433612998] [2022-12-13 21:42:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:08,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:08,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433612998] [2022-12-13 21:42:08,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433612998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:08,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:08,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:42:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201534271] [2022-12-13 21:42:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:42:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:42:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:42:08,341 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 352 [2022-12-13 21:42:08,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 824 flow. Second operand has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:08,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:08,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 352 [2022-12-13 21:42:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:08,833 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][74], [Black: 253#(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: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(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)), 288#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 245#true, 185#true, 156#t3_funEXITtrue, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(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: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), Black: 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 204#true, 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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|)), 125#$Ultimate##0true, Black: 222#true, Black: 232#(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|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 129#L737-2true]) [2022-12-13 21:42:08,833 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 21:42:08,834 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 21:42:08,834 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 21:42:08,834 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 21:42:08,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_11|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_11|, 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][85], [Black: 253#(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: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(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)), 288#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 2#ULTIMATE.startEXITtrue, Black: 245#true, 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 185#true, 156#t3_funEXITtrue, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(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: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 126#L693true, 204#true, 122#L706true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), t_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)))]) [2022-12-13 21:42:08,984 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 21:42:08,984 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:08,985 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:08,985 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:08,985 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_11|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_11|, 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][85], [Black: 253#(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: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 288#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 255#(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: 245#true, 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 185#true, 156#t3_funEXITtrue, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(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: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), Black: 206#(<= ~h~0 ~g~0), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 82#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 126#L693true, 204#true, 122#L706true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), t_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)))]) [2022-12-13 21:42:08,985 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 21:42:08,985 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:08,985 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:08,985 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:09,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L693-->L694: Formula: (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#A~0.base_15| (store (select |v_#pthreadsMutex_30| |v_~#A~0.base_15|) |v_~#A~0.offset_15| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#A~0.offset=|v_~#A~0.offset_15|, ~#A~0.base=|v_~#A~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex][74], [Black: 253#(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: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(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)), 288#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 245#true, 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#true, 156#t3_funEXITtrue, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(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: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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: 204#true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), 14#L694true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 129#L737-2true, 176#t2_funEXITtrue]) [2022-12-13 21:42:09,110 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 21:42:09,110 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:09,110 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:09,110 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:09,354 INFO L130 PetriNetUnfolder]: 6002/10556 cut-off events. [2022-12-13 21:42:09,354 INFO L131 PetriNetUnfolder]: For 28482/28897 co-relation queries the response was YES. [2022-12-13 21:42:09,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37412 conditions, 10556 events. 6002/10556 cut-off events. For 28482/28897 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 78309 event pairs, 2225 based on Foata normal form. 156/9786 useless extension candidates. Maximal degree in co-relation 37385. Up to 5994 conditions per place. [2022-12-13 21:42:09,413 INFO L137 encePairwiseOnDemand]: 350/352 looper letters, 89 selfloop transitions, 4 changer transitions 0/123 dead transitions. [2022-12-13 21:42:09,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 123 transitions, 1210 flow [2022-12-13 21:42:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:42:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:42:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2022-12-13 21:42:09,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4933712121212121 [2022-12-13 21:42:09,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2022-12-13 21:42:09,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2022-12-13 21:42:09,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:09,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2022-12-13 21:42:09,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:09,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:09,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:09,417 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 824 flow. Second operand 3 states and 521 transitions. [2022-12-13 21:42:09,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 123 transitions, 1210 flow [2022-12-13 21:42:09,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 123 transitions, 1151 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 21:42:09,565 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 779 flow [2022-12-13 21:42:09,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2022-12-13 21:42:09,566 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2022-12-13 21:42:09,566 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 779 flow [2022-12-13 21:42:09,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:09,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:09,566 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:09,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:42:09,566 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:42:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1118892194, now seen corresponding path program 1 times [2022-12-13 21:42:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:09,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615649620] [2022-12-13 21:42:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:09,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615649620] [2022-12-13 21:42:09,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615649620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:09,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:09,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:42:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471846205] [2022-12-13 21:42:09,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:09,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:42:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:09,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:42:09,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:42:09,765 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 352 [2022-12-13 21:42:09,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:09,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:09,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 352 [2022-12-13 21:42:09,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:10,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_11|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_11|, 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][86], [Black: 253#(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: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(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)), 288#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 2#ULTIMATE.startEXITtrue, Black: 245#true, 290#true, 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 185#true, 156#t3_funEXITtrue, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(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: 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), Black: 206#(<= ~h~0 ~g~0), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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|)), 126#L693true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 204#true, 122#L706true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)))]) [2022-12-13 21:42:10,210 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,210 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,210 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,210 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,225 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L704-1-->L706: Formula: (= v_~g~0_10 |v_t2_funThread1of1ForFork0_~x~1#1_11|) InVars {~g~0=v_~g~0_10} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_11|, 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][86], [Black: 253#(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: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 255#(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)), 288#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 2#ULTIMATE.startEXITtrue, Black: 245#true, 290#true, 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 185#true, 156#t3_funEXITtrue, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(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: 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), Black: 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 206#(<= ~h~0 ~g~0), Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 226#(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|)), 126#L693true, Black: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 204#true, 122#L706true, Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), t_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1)))]) [2022-12-13 21:42:10,225 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,225 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,226 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,226 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 21:42:10,314 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([594] L719-->t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| 0) (= (store |v_#pthreadsMutex_110| |v_~#B~0.base_51| (store (select |v_#pthreadsMutex_110| |v_~#B~0.base_51|) |v_~#B~0.offset_51| 0)) |v_#pthreadsMutex_109|) (= (ite (= |v_t3_funThread1of1ForFork2_~x~2#1_19| |v_t3_funThread1of1ForFork2_~y~1#1_19|) 1 0) |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_19|) (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31| |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_19|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, ~#B~0.base=|v_~#B~0.base_51|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_19|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_19|, ~#B~0.offset=|v_~#B~0.offset_51|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, ~#B~0.base=|v_~#B~0.base_51|, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_19|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_19|, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_31|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_19|, ~#B~0.offset=|v_~#B~0.offset_51|} AuxVars[] AssignedVars[#pthreadsMutex, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1][113], [Black: 253#(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: 248#(and (<= ~h~0 |t3_funThread1of1ForFork2_~x~2#1|) (<= |t3_funThread1of1ForFork2_~x~2#1| ~h~0)), Black: 247#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 288#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 255#(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)), 2#ULTIMATE.startEXITtrue, Black: 249#(and (<= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|) (< |t3_funThread1of1ForFork2_~y~1#1| (+ |t3_funThread1of1ForFork2_~x~2#1| 1))), 290#true, 105#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 208#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#true, Black: 277#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 275#(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: 214#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 273#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 206#(<= ~h~0 ~g~0), 245#true, Black: 207#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 204#true, 226#(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: 212#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 126#L693true, 270#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 225#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 224#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 230#(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: 222#true, Black: 232#(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|)), t_funThread1of1ForFork1InUse, Black: 242#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 176#t2_funEXITtrue]) [2022-12-13 21:42:10,314 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 21:42:10,314 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:10,314 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:10,314 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 21:42:10,465 INFO L130 PetriNetUnfolder]: 3982/7343 cut-off events. [2022-12-13 21:42:10,465 INFO L131 PetriNetUnfolder]: For 20222/20546 co-relation queries the response was YES. [2022-12-13 21:42:10,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26187 conditions, 7343 events. 3982/7343 cut-off events. For 20222/20546 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 55927 event pairs, 1638 based on Foata normal form. 163/7221 useless extension candidates. Maximal degree in co-relation 26160. Up to 4154 conditions per place. [2022-12-13 21:42:10,496 INFO L137 encePairwiseOnDemand]: 349/352 looper letters, 89 selfloop transitions, 2 changer transitions 3/128 dead transitions. [2022-12-13 21:42:10,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 128 transitions, 1237 flow [2022-12-13 21:42:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:42:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:42:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2022-12-13 21:42:10,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4876893939393939 [2022-12-13 21:42:10,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2022-12-13 21:42:10,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2022-12-13 21:42:10,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:10,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2022-12-13 21:42:10,499 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) [2022-12-13 21:42:10,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:10,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:10,501 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 779 flow. Second operand 3 states and 515 transitions. [2022-12-13 21:42:10,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 128 transitions, 1237 flow [2022-12-13 21:42:10,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1233 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:42:10,569 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 747 flow [2022-12-13 21:42:10,569 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=773, 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=747, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2022-12-13 21:42:10,569 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2022-12-13 21:42:10,570 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 747 flow [2022-12-13 21:42:10,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:10,570 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:10,570 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:10,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:42:10,570 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:42:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1104000434, now seen corresponding path program 1 times [2022-12-13 21:42:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:10,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512340627] [2022-12-13 21:42:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:10,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:10,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512340627] [2022-12-13 21:42:10,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512340627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:10,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:10,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:42:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739529936] [2022-12-13 21:42:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:10,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:42:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:42:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:42:10,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 352 [2022-12-13 21:42:10,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 747 flow. Second operand has 5 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:10,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:10,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 352 [2022-12-13 21:42:10,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:11,051 INFO L130 PetriNetUnfolder]: 1519/3250 cut-off events. [2022-12-13 21:42:11,051 INFO L131 PetriNetUnfolder]: For 8358/8512 co-relation queries the response was YES. [2022-12-13 21:42:11,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11693 conditions, 3250 events. 1519/3250 cut-off events. For 8358/8512 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 23141 event pairs, 326 based on Foata normal form. 422/3587 useless extension candidates. Maximal degree in co-relation 11666. Up to 1979 conditions per place. [2022-12-13 21:42:11,063 INFO L137 encePairwiseOnDemand]: 343/352 looper letters, 60 selfloop transitions, 17 changer transitions 2/104 dead transitions. [2022-12-13 21:42:11,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 104 transitions, 944 flow [2022-12-13 21:42:11,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:42:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:42:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2022-12-13 21:42:11,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4666193181818182 [2022-12-13 21:42:11,065 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2022-12-13 21:42:11,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2022-12-13 21:42:11,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:11,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2022-12-13 21:42:11,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,067 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 747 flow. Second operand 4 states and 657 transitions. [2022-12-13 21:42:11,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 104 transitions, 944 flow [2022-12-13 21:42:11,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 104 transitions, 917 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 21:42:11,096 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 692 flow [2022-12-13 21:42:11,096 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=692, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2022-12-13 21:42:11,097 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2022-12-13 21:42:11,097 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 692 flow [2022-12-13 21:42:11,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:11,097 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:11,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:42:11,097 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:42:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1768853678, now seen corresponding path program 1 times [2022-12-13 21:42:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:11,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686566826] [2022-12-13 21:42:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:11,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686566826] [2022-12-13 21:42:11,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686566826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:11,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:11,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:42:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665091343] [2022-12-13 21:42:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:42:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:42:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:42:11,200 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 352 [2022-12-13 21:42:11,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:11,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 352 [2022-12-13 21:42:11,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:11,724 INFO L130 PetriNetUnfolder]: 1515/3254 cut-off events. [2022-12-13 21:42:11,724 INFO L131 PetriNetUnfolder]: For 8453/8588 co-relation queries the response was YES. [2022-12-13 21:42:11,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12029 conditions, 3254 events. 1515/3254 cut-off events. For 8453/8588 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 23490 event pairs, 191 based on Foata normal form. 160/3389 useless extension candidates. Maximal degree in co-relation 12004. Up to 1263 conditions per place. [2022-12-13 21:42:11,735 INFO L137 encePairwiseOnDemand]: 344/352 looper letters, 162 selfloop transitions, 39 changer transitions 14/229 dead transitions. [2022-12-13 21:42:11,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 229 transitions, 1940 flow [2022-12-13 21:42:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:42:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 21:42:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2174 transitions. [2022-12-13 21:42:11,737 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4750874125874126 [2022-12-13 21:42:11,738 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2174 transitions. [2022-12-13 21:42:11,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2174 transitions. [2022-12-13 21:42:11,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:11,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2174 transitions. [2022-12-13 21:42:11,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 167.23076923076923) internal successors, (2174), 13 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 352.0) internal successors, (4928), 14 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,744 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 352.0) internal successors, (4928), 14 states have internal predecessors, (4928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,744 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 692 flow. Second operand 13 states and 2174 transitions. [2022-12-13 21:42:11,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 229 transitions, 1940 flow [2022-12-13 21:42:11,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 229 transitions, 1860 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 21:42:11,764 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 858 flow [2022-12-13 21:42:11,765 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=673, 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=858, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2022-12-13 21:42:11,765 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2022-12-13 21:42:11,765 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 858 flow [2022-12-13 21:42:11,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:11,766 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:11,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:42:11,766 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)] === [2022-12-13 21:42:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash 511979301, now seen corresponding path program 1 times [2022-12-13 21:42:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:11,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096534641] [2022-12-13 21:42:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:11,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096534641] [2022-12-13 21:42:11,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096534641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:11,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:11,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:42:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628660544] [2022-12-13 21:42:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:11,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:42:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:42:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:42:11,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 352 [2022-12-13 21:42:11,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 858 flow. Second operand has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:11,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:11,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 352 [2022-12-13 21:42:11,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:12,053 INFO L130 PetriNetUnfolder]: 373/1143 cut-off events. [2022-12-13 21:42:12,053 INFO L131 PetriNetUnfolder]: For 2344/2426 co-relation queries the response was YES. [2022-12-13 21:42:12,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4144 conditions, 1143 events. 373/1143 cut-off events. For 2344/2426 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7703 event pairs, 139 based on Foata normal form. 77/1214 useless extension candidates. Maximal degree in co-relation 4115. Up to 619 conditions per place. [2022-12-13 21:42:12,057 INFO L137 encePairwiseOnDemand]: 341/352 looper letters, 41 selfloop transitions, 14 changer transitions 3/73 dead transitions. [2022-12-13 21:42:12,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 73 transitions, 685 flow [2022-12-13 21:42:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:42:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:42:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2022-12-13 21:42:12,058 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45951704545454547 [2022-12-13 21:42:12,058 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 647 transitions. [2022-12-13 21:42:12,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 647 transitions. [2022-12-13 21:42:12,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:12,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 647 transitions. [2022-12-13 21:42:12,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,060 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,061 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 858 flow. Second operand 4 states and 647 transitions. [2022-12-13 21:42:12,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 73 transitions, 685 flow [2022-12-13 21:42:12,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 73 transitions, 557 flow, removed 18 selfloop flow, removed 21 redundant places. [2022-12-13 21:42:12,068 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 419 flow [2022-12-13 21:42:12,068 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=419, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2022-12-13 21:42:12,068 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2022-12-13 21:42:12,068 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 419 flow [2022-12-13 21:42:12,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,069 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:12,069 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:12,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:42:12,069 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:42:12,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 143657805, now seen corresponding path program 1 times [2022-12-13 21:42:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563639232] [2022-12-13 21:42:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:12,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563639232] [2022-12-13 21:42:12,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563639232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:12,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:12,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:42:12,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750572152] [2022-12-13 21:42:12,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:12,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:42:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:12,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:42:12,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:42:12,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 352 [2022-12-13 21:42:12,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:12,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 352 [2022-12-13 21:42:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:12,569 INFO L130 PetriNetUnfolder]: 429/1278 cut-off events. [2022-12-13 21:42:12,569 INFO L131 PetriNetUnfolder]: For 1553/1553 co-relation queries the response was YES. [2022-12-13 21:42:12,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 1278 events. 429/1278 cut-off events. For 1553/1553 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8434 event pairs, 168 based on Foata normal form. 24/1299 useless extension candidates. Maximal degree in co-relation 4345. Up to 338 conditions per place. [2022-12-13 21:42:12,572 INFO L137 encePairwiseOnDemand]: 345/352 looper letters, 77 selfloop transitions, 15 changer transitions 31/132 dead transitions. [2022-12-13 21:42:12,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 132 transitions, 1029 flow [2022-12-13 21:42:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 21:42:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 21:42:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1957 transitions. [2022-12-13 21:42:12,575 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46330492424242425 [2022-12-13 21:42:12,575 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1957 transitions. [2022-12-13 21:42:12,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1957 transitions. [2022-12-13 21:42:12,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:12,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1957 transitions. [2022-12-13 21:42:12,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 163.08333333333334) internal successors, (1957), 12 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 352.0) internal successors, (4576), 13 states have internal predecessors, (4576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,580 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 352.0) internal successors, (4576), 13 states have internal predecessors, (4576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,580 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 419 flow. Second operand 12 states and 1957 transitions. [2022-12-13 21:42:12,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 132 transitions, 1029 flow [2022-12-13 21:42:12,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 983 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 21:42:12,584 INFO L231 Difference]: Finished difference. Result has 91 places, 53 transitions, 340 flow [2022-12-13 21:42:12,584 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=340, PETRI_PLACES=91, PETRI_TRANSITIONS=53} [2022-12-13 21:42:12,584 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 37 predicate places. [2022-12-13 21:42:12,584 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 53 transitions, 340 flow [2022-12-13 21:42:12,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,585 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:42:12,585 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:12,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:42:12,585 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:42:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:42:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1164715511, now seen corresponding path program 1 times [2022-12-13 21:42:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:42:12,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599863061] [2022-12-13 21:42:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:42:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:42:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:42:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:42:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:42:12,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599863061] [2022-12-13 21:42:12,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599863061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:42:12,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:42:12,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:42:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082838013] [2022-12-13 21:42:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:42:12,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:42:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:42:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:42:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:42:12,716 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 352 [2022-12-13 21:42:12,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 53 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:42:12,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 352 [2022-12-13 21:42:12,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:42:12,898 INFO L130 PetriNetUnfolder]: 232/725 cut-off events. [2022-12-13 21:42:12,898 INFO L131 PetriNetUnfolder]: For 893/905 co-relation queries the response was YES. [2022-12-13 21:42:12,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 725 events. 232/725 cut-off events. For 893/905 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4082 event pairs, 112 based on Foata normal form. 34/756 useless extension candidates. Maximal degree in co-relation 2270. Up to 298 conditions per place. [2022-12-13 21:42:12,900 INFO L137 encePairwiseOnDemand]: 346/352 looper letters, 0 selfloop transitions, 0 changer transitions 76/76 dead transitions. [2022-12-13 21:42:12,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 76 transitions, 551 flow [2022-12-13 21:42:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:42:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:42:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1145 transitions. [2022-12-13 21:42:12,902 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46469155844155846 [2022-12-13 21:42:12,902 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1145 transitions. [2022-12-13 21:42:12,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1145 transitions. [2022-12-13 21:42:12,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:42:12,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1145 transitions. [2022-12-13 21:42:12,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.57142857142858) internal successors, (1145), 7 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,906 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 352.0) internal successors, (2816), 8 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,906 INFO L175 Difference]: Start difference. First operand has 91 places, 53 transitions, 340 flow. Second operand 7 states and 1145 transitions. [2022-12-13 21:42:12,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 76 transitions, 551 flow [2022-12-13 21:42:12,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 504 flow, removed 5 selfloop flow, removed 11 redundant places. [2022-12-13 21:42:12,908 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2022-12-13 21:42:12,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2022-12-13 21:42:12,908 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2022-12-13 21:42:12,908 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2022-12-13 21:42:12,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:42:12,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 21:42:12,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 21:42:12,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 21:42:12,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 16 remaining) [2022-12-13 21:42:12,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 21:42:12,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:42:12,912 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:42:12,915 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:42:12,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:42:12,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:42:12 BasicIcfg [2022-12-13 21:42:12,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:42:12,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:42:12,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:42:12,919 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:42:12,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:41:53" (3/4) ... [2022-12-13 21:42:12,921 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 21:42:12,925 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2022-12-13 21:42:12,925 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2022-12-13 21:42:12,925 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-12-13 21:42:12,928 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-12-13 21:42:12,928 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-13 21:42:12,929 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 21:42:12,929 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 21:42:12,954 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:42:12,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:42:12,955 INFO L158 Benchmark]: Toolchain (without parser) took 19756.33ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 76.7MB in the beginning and 537.7MB in the end (delta: -461.1MB). Peak memory consumption was 812.8MB. Max. memory is 16.1GB. [2022-12-13 21:42:12,955 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:42:12,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.21ms. Allocated memory is still 113.2MB. Free memory was 76.4MB in the beginning and 56.7MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 21:42:12,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.79ms. Allocated memory is still 113.2MB. Free memory was 56.7MB in the beginning and 54.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 21:42:12,956 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 113.2MB. Free memory was 54.2MB in the beginning and 52.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:42:12,956 INFO L158 Benchmark]: RCFGBuilder took 385.42ms. Allocated memory is still 113.2MB. Free memory was 52.5MB in the beginning and 69.3MB in the end (delta: -16.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-12-13 21:42:12,956 INFO L158 Benchmark]: TraceAbstraction took 18956.71ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 68.8MB in the beginning and 540.9MB in the end (delta: -472.0MB). Peak memory consumption was 801.7MB. Max. memory is 16.1GB. [2022-12-13 21:42:12,956 INFO L158 Benchmark]: Witness Printer took 35.71ms. Allocated memory is still 1.4GB. Free memory was 540.9MB in the beginning and 537.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:42:12,958 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.14ms. Allocated memory is still 113.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.21ms. Allocated memory is still 113.2MB. Free memory was 76.4MB in the beginning and 56.7MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.79ms. Allocated memory is still 113.2MB. Free memory was 56.7MB in the beginning and 54.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 113.2MB. Free memory was 54.2MB in the beginning and 52.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 385.42ms. Allocated memory is still 113.2MB. Free memory was 52.5MB in the beginning and 69.3MB in the end (delta: -16.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18956.71ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 68.8MB in the beginning and 540.9MB in the end (delta: -472.0MB). Peak memory consumption was 801.7MB. Max. memory is 16.1GB. * Witness Printer took 35.71ms. Allocated memory is still 1.4GB. Free memory was 540.9MB in the beginning and 537.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 179 PlacesBefore, 54 PlacesAfterwards, 174 TransitionsBefore, 46 TransitionsAfterwards, 10466 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 107 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 3 ChoiceCompositions, 175 TotalNumberOfCompositions, 21435 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11984, independent: 11623, independent conditional: 0, independent unconditional: 11623, dependent: 361, dependent conditional: 0, dependent unconditional: 361, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5755, independent: 5702, independent conditional: 0, independent unconditional: 5702, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11984, independent: 5921, independent conditional: 0, independent unconditional: 5921, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 5755, unknown conditional: 0, unknown unconditional: 5755] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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, 247 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.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1675 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1256 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3128 IncrementalHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 102 mSDtfsCounter, 3128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=858occurred in iteration=14, InterpolantAutomatonStates: 94, 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.2s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2022-12-13 21:42:12,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a10cf36e-10c6-4c73-88da-90cbda3020c5/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE