./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --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 828cbbb8bb1b7fb83d1c4d35071bdac7e1b4ae65dfc83ebb19446976ecd8d980 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:57:36,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:57:36,521 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:57:36,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:57:36,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:57:36,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:57:36,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:57:36,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:57:36,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:57:36,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:57:36,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:57:36,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:57:36,582 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:57:36,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:57:36,585 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:57:36,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:57:36,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:57:36,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:57:36,587 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:57:36,588 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:57:36,588 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:57:36,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:57:36,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:57:36,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:57:36,590 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:57:36,591 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:57:36,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:57:36,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:57:36,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:57:36,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:57:36,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:57:36,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:57:36,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:57:36,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:57:36,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:57:36,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:57:36,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:57:36,597 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:57:36,597 INFO L153 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_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/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_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 828cbbb8bb1b7fb83d1c4d35071bdac7e1b4ae65dfc83ebb19446976ecd8d980 [2023-11-19 07:57:36,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:57:37,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:57:37,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:57:37,011 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:57:37,012 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:57:37,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i [2023-11-19 07:57:40,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:57:40,671 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:57:40,672 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/sv-benchmarks/c/pthread-ext/40_barrier_vf-pthread.i [2023-11-19 07:57:40,701 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/data/de9ceef53/ac64647fb18640f4b4b14e02bdd63042/FLAG9a8bf6d6d [2023-11-19 07:57:40,748 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/data/de9ceef53/ac64647fb18640f4b4b14e02bdd63042 [2023-11-19 07:57:40,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:57:40,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:57:40,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:40,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:57:40,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:57:40,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:40" (1/1) ... [2023-11-19 07:57:40,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d01b626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:40, skipping insertion in model container [2023-11-19 07:57:40,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:40" (1/1) ... [2023-11-19 07:57:40,873 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:57:41,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:41,342 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:57:41,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:41,433 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:57:41,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41 WrapperNode [2023-11-19 07:57:41,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:41,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:41,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:57:41,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:57:41,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,500 INFO L138 Inliner]: procedures = 164, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-11-19 07:57:41,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:41,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:57:41,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:57:41,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:57:41,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:57:41,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:57:41,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:57:41,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:57:41,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (1/1) ... [2023-11-19 07:57:41,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:57:41,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:41,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:57:41,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c1e36e-aa0b-417c-8de5-66c73398cd7a/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:57:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-19 07:57:41,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-19 07:57:41,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:57:41,618 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-19 07:57:41,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:57:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:57:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:57:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:57:41,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:57:41,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:57:41,621 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:57:41,742 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:57:41,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:57:41,946 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:57:41,956 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:57:41,956 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 07:57:41,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:41 BoogieIcfgContainer [2023-11-19 07:57:41,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:57:41,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:57:41,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:57:41,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:57:41,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:57:40" (1/3) ... [2023-11-19 07:57:41,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f88fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:41, skipping insertion in model container [2023-11-19 07:57:41,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:41" (2/3) ... [2023-11-19 07:57:41,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f88fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:41, skipping insertion in model container [2023-11-19 07:57:41,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:41" (3/3) ... [2023-11-19 07:57:41,974 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf-pthread.i [2023-11-19 07:57:41,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:57:41,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 07:57:41,995 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:57:42,082 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:57:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 166 flow [2023-11-19 07:57:42,201 INFO L124 PetriNetUnfolderBase]: 7/97 cut-off events. [2023-11-19 07:57:42,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:42,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 7/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2023-11-19 07:57:42,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 81 transitions, 166 flow [2023-11-19 07:57:42,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 81 transitions, 166 flow [2023-11-19 07:57:42,216 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:57:42,253 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 81 transitions, 166 flow [2023-11-19 07:57:42,256 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 81 transitions, 166 flow [2023-11-19 07:57:42,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 81 transitions, 166 flow [2023-11-19 07:57:42,287 INFO L124 PetriNetUnfolderBase]: 7/97 cut-off events. [2023-11-19 07:57:42,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:42,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 7/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 131 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2023-11-19 07:57:42,290 INFO L119 LiptonReduction]: Number of co-enabled transitions 1140 [2023-11-19 07:57:45,732 INFO L134 LiptonReduction]: Checked pairs total: 1050 [2023-11-19 07:57:45,732 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-11-19 07:57:45,749 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:57:45,757 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;@6a01c977, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:57:45,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:57:45,760 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:57:45,760 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-19 07:57:45,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:45,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:45,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:57:45,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 07:57:45,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 10823, now seen corresponding path program 1 times [2023-11-19 07:57:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701795456] [2023-11-19 07:57:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701795456] [2023-11-19 07:57:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701795456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:46,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775515038] [2023-11-19 07:57:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:46,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:46,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:46,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:46,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:46,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 166 [2023-11-19 07:57:46,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 15 transitions, 34 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:46,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 166 [2023-11-19 07:57:46,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:46,344 INFO L124 PetriNetUnfolderBase]: 17/39 cut-off events. [2023-11-19 07:57:46,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:46,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 39 events. 17/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 9 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 64. Up to 36 conditions per place. [2023-11-19 07:57:46,349 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-11-19 07:57:46,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 11 transitions, 46 flow [2023-11-19 07:57:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2023-11-19 07:57:46,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43775100401606426 [2023-11-19 07:57:46,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2023-11-19 07:57:46,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2023-11-19 07:57:46,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:46,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2023-11-19 07:57:46,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,390 INFO L175 Difference]: Start difference. First operand has 16 places, 15 transitions, 34 flow. Second operand 3 states and 218 transitions. [2023-11-19 07:57:46,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 11 transitions, 46 flow [2023-11-19 07:57:46,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 11 transitions, 46 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:57:46,396 INFO L231 Difference]: Finished difference. Result has 14 places, 11 transitions, 28 flow [2023-11-19 07:57:46,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=28, PETRI_PLACES=14, PETRI_TRANSITIONS=11} [2023-11-19 07:57:46,402 INFO L281 CegarLoopForPetriNet]: 16 programPoint places, -2 predicate places. [2023-11-19 07:57:46,402 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 11 transitions, 28 flow [2023-11-19 07:57:46,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:46,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:57:46,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:57:46,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 07:57:46,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 10824, now seen corresponding path program 1 times [2023-11-19 07:57:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529215051] [2023-11-19 07:57:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:46,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:46,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529215051] [2023-11-19 07:57:46,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529215051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:46,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:46,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:46,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476797538] [2023-11-19 07:57:46,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:46,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 166 [2023-11-19 07:57:46,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 11 transitions, 28 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:46,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 166 [2023-11-19 07:57:46,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:46,524 INFO L124 PetriNetUnfolderBase]: 12/29 cut-off events. [2023-11-19 07:57:46,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:46,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 12/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 6 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 55. Up to 26 conditions per place. [2023-11-19 07:57:46,525 INFO L140 encePairwiseOnDemand]: 164/166 looper letters, 8 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2023-11-19 07:57:46,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 10 transitions, 44 flow [2023-11-19 07:57:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2023-11-19 07:57:46,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41767068273092367 [2023-11-19 07:57:46,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 208 transitions. [2023-11-19 07:57:46,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 208 transitions. [2023-11-19 07:57:46,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:46,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 208 transitions. [2023-11-19 07:57:46,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,534 INFO L175 Difference]: Start difference. First operand has 14 places, 11 transitions, 28 flow. Second operand 3 states and 208 transitions. [2023-11-19 07:57:46,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 10 transitions, 44 flow [2023-11-19 07:57:46,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 10 transitions, 43 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:46,538 INFO L231 Difference]: Finished difference. Result has 14 places, 10 transitions, 27 flow [2023-11-19 07:57:46,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=25, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=27, PETRI_PLACES=14, PETRI_TRANSITIONS=10} [2023-11-19 07:57:46,539 INFO L281 CegarLoopForPetriNet]: 16 programPoint places, -2 predicate places. [2023-11-19 07:57:46,540 INFO L495 AbstractCegarLoop]: Abstraction has has 14 places, 10 transitions, 27 flow [2023-11-19 07:57:46,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:46,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:57:46,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:57:46,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 07:57:46,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash 322623139, now seen corresponding path program 1 times [2023-11-19 07:57:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060521943] [2023-11-19 07:57:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:46,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060521943] [2023-11-19 07:57:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060521943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:57:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164782055] [2023-11-19 07:57:46,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:46,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:46,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 166 [2023-11-19 07:57:46,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 10 transitions, 27 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:46,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 166 [2023-11-19 07:57:46,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:46,738 INFO L124 PetriNetUnfolderBase]: 9/24 cut-off events. [2023-11-19 07:57:46,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:46,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 24 events. 9/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 47. Up to 19 conditions per place. [2023-11-19 07:57:46,739 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 8 selfloop transitions, 2 changer transitions 0/11 dead transitions. [2023-11-19 07:57:46,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 49 flow [2023-11-19 07:57:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2023-11-19 07:57:46,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43775100401606426 [2023-11-19 07:57:46,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2023-11-19 07:57:46,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2023-11-19 07:57:46,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:46,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2023-11-19 07:57:46,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,747 INFO L175 Difference]: Start difference. First operand has 14 places, 10 transitions, 27 flow. Second operand 3 states and 218 transitions. [2023-11-19 07:57:46,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 49 flow [2023-11-19 07:57:46,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 11 transitions, 48 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:46,749 INFO L231 Difference]: Finished difference. Result has 15 places, 9 transitions, 28 flow [2023-11-19 07:57:46,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=28, PETRI_PLACES=15, PETRI_TRANSITIONS=9} [2023-11-19 07:57:46,750 INFO L281 CegarLoopForPetriNet]: 16 programPoint places, -1 predicate places. [2023-11-19 07:57:46,750 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 9 transitions, 28 flow [2023-11-19 07:57:46,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:46,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:46,751 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 07:57:46,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:57:46,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 07:57:46,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1411337835, now seen corresponding path program 1 times [2023-11-19 07:57:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092786766] [2023-11-19 07:57:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:46,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:57:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:46,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:57:46,819 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:57:46,819 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-19 07:57:46,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2023-11-19 07:57:46,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-19 07:57:46,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-19 07:57:46,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2023-11-19 07:57:46,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2023-11-19 07:57:46,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:57:46,823 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-19 07:57:46,826 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:57:46,826 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 07:57:46,852 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:57:46,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 112 transitions, 234 flow [2023-11-19 07:57:46,888 INFO L124 PetriNetUnfolderBase]: 13/146 cut-off events. [2023-11-19 07:57:46,888 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:57:46,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 146 events. 13/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 332 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2023-11-19 07:57:46,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 112 transitions, 234 flow [2023-11-19 07:57:46,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 112 transitions, 234 flow [2023-11-19 07:57:46,893 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:57:46,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 112 transitions, 234 flow [2023-11-19 07:57:46,895 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 112 transitions, 234 flow [2023-11-19 07:57:46,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 112 transitions, 234 flow [2023-11-19 07:57:46,920 INFO L124 PetriNetUnfolderBase]: 13/146 cut-off events. [2023-11-19 07:57:46,920 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:57:46,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 146 events. 13/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 332 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2023-11-19 07:57:46,930 INFO L119 LiptonReduction]: Number of co-enabled transitions 4140 [2023-11-19 07:57:49,729 INFO L134 LiptonReduction]: Checked pairs total: 11263 [2023-11-19 07:57:49,729 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-11-19 07:57:49,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:57:49,733 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;@6a01c977, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:57:49,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 07:57:49,735 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:57:49,736 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:57:49,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:49,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:49,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:57:49,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 07:57:49,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 18475, now seen corresponding path program 1 times [2023-11-19 07:57:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:49,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659012351] [2023-11-19 07:57:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659012351] [2023-11-19 07:57:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659012351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183588458] [2023-11-19 07:57:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:57:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:57:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:57:49,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 208 [2023-11-19 07:57:49,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:49,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:49,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 208 [2023-11-19 07:57:49,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:49,901 INFO L124 PetriNetUnfolderBase]: 242/606 cut-off events. [2023-11-19 07:57:49,904 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-19 07:57:49,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 606 events. 242/606 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3678 event pairs, 148 based on Foata normal form. 69/539 useless extension candidates. Maximal degree in co-relation 450. Up to 345 conditions per place. [2023-11-19 07:57:49,912 INFO L140 encePairwiseOnDemand]: 202/208 looper letters, 15 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-11-19 07:57:49,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 110 flow [2023-11-19 07:57:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:57:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:57:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 217 transitions. [2023-11-19 07:57:49,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216346153846154 [2023-11-19 07:57:49,915 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 217 transitions. [2023-11-19 07:57:49,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 217 transitions. [2023-11-19 07:57:49,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:49,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 217 transitions. [2023-11-19 07:57:49,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:49,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:49,925 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:49,925 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 92 flow. Second operand 2 states and 217 transitions. [2023-11-19 07:57:49,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 110 flow [2023-11-19 07:57:49,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:57:49,927 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 80 flow [2023-11-19 07:57:49,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2023-11-19 07:57:49,930 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-19 07:57:49,930 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 80 flow [2023-11-19 07:57:49,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:49,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:49,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:57:49,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:57:49,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 07:57:49,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash 18461, now seen corresponding path program 1 times [2023-11-19 07:57:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:49,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469663671] [2023-11-19 07:57:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:49,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:49,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469663671] [2023-11-19 07:57:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469663671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:49,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693164857] [2023-11-19 07:57:49,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:49,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:50,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 208 [2023-11-19 07:57:50,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:50,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 208 [2023-11-19 07:57:50,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:50,097 INFO L124 PetriNetUnfolderBase]: 175/448 cut-off events. [2023-11-19 07:57:50,097 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-19 07:57:50,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 448 events. 175/448 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2475 event pairs, 105 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 713. Up to 251 conditions per place. [2023-11-19 07:57:50,102 INFO L140 encePairwiseOnDemand]: 206/208 looper letters, 13 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-19 07:57:50,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 106 flow [2023-11-19 07:57:50,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-11-19 07:57:50,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-11-19 07:57:50,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-11-19 07:57:50,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-11-19 07:57:50,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:50,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-11-19 07:57:50,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,111 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 80 flow. Second operand 3 states and 288 transitions. [2023-11-19 07:57:50,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 106 flow [2023-11-19 07:57:50,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:57:50,113 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 80 flow [2023-11-19 07:57:50,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2023-11-19 07:57:50,114 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-19 07:57:50,114 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 80 flow [2023-11-19 07:57:50,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:50,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:57:50,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:57:50,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 07:57:50,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 18460, now seen corresponding path program 1 times [2023-11-19 07:57:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008332877] [2023-11-19 07:57:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008332877] [2023-11-19 07:57:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008332877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:50,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:50,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827129301] [2023-11-19 07:57:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:50,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:50,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:50,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:50,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2023-11-19 07:57:50,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:50,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2023-11-19 07:57:50,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:50,297 INFO L124 PetriNetUnfolderBase]: 108/290 cut-off events. [2023-11-19 07:57:50,297 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-19 07:57:50,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 290 events. 108/290 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1399 event pairs, 62 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 463. Up to 158 conditions per place. [2023-11-19 07:57:50,301 INFO L140 encePairwiseOnDemand]: 206/208 looper letters, 12 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-11-19 07:57:50,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 104 flow [2023-11-19 07:57:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-11-19 07:57:50,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46955128205128205 [2023-11-19 07:57:50,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-11-19 07:57:50,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-11-19 07:57:50,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:50,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-11-19 07:57:50,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,309 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 80 flow. Second operand 3 states and 293 transitions. [2023-11-19 07:57:50,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 104 flow [2023-11-19 07:57:50,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:50,312 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 79 flow [2023-11-19 07:57:50,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-19 07:57:50,314 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-19 07:57:50,315 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 79 flow [2023-11-19 07:57:50,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:50,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:50,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:57:50,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 07:57:50,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:50,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1485766551, now seen corresponding path program 1 times [2023-11-19 07:57:50,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810597385] [2023-11-19 07:57:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:50,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810597385] [2023-11-19 07:57:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810597385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:50,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:57:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528027978] [2023-11-19 07:57:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:50,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:50,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 208 [2023-11-19 07:57:50,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:50,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 208 [2023-11-19 07:57:50,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:50,543 INFO L124 PetriNetUnfolderBase]: 148/358 cut-off events. [2023-11-19 07:57:50,543 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:57:50,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 358 events. 148/358 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1777 event pairs, 46 based on Foata normal form. 27/364 useless extension candidates. Maximal degree in co-relation 620. Up to 147 conditions per place. [2023-11-19 07:57:50,547 INFO L140 encePairwiseOnDemand]: 203/208 looper letters, 25 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-11-19 07:57:50,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 162 flow [2023-11-19 07:57:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-11-19 07:57:50,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951923076923077 [2023-11-19 07:57:50,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-11-19 07:57:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-11-19 07:57:50,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:50,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-11-19 07:57:50,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,556 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 79 flow. Second operand 3 states and 309 transitions. [2023-11-19 07:57:50,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 162 flow [2023-11-19 07:57:50,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:50,558 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 99 flow [2023-11-19 07:57:50,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-11-19 07:57:50,561 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-19 07:57:50,561 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 99 flow [2023-11-19 07:57:50,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:50,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:50,562 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 07:57:50,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:57:50,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 07:57:50,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash 767268124, now seen corresponding path program 1 times [2023-11-19 07:57:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410523952] [2023-11-19 07:57:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:50,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:57:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:50,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:57:50,612 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:57:50,613 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-19 07:57:50,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2023-11-19 07:57:50,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2023-11-19 07:57:50,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2023-11-19 07:57:50,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2023-11-19 07:57:50,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2023-11-19 07:57:50,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2023-11-19 07:57:50,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:57:50,614 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-19 07:57:50,616 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:57:50,616 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 07:57:50,661 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:57:50,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 143 transitions, 304 flow [2023-11-19 07:57:50,705 INFO L124 PetriNetUnfolderBase]: 19/195 cut-off events. [2023-11-19 07:57:50,705 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:57:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 195 events. 19/195 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 532 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2023-11-19 07:57:50,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 143 transitions, 304 flow [2023-11-19 07:57:50,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 143 transitions, 304 flow [2023-11-19 07:57:50,709 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:57:50,709 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 143 transitions, 304 flow [2023-11-19 07:57:50,710 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 143 transitions, 304 flow [2023-11-19 07:57:50,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 143 transitions, 304 flow [2023-11-19 07:57:50,735 INFO L124 PetriNetUnfolderBase]: 19/195 cut-off events. [2023-11-19 07:57:50,735 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:57:50,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 195 events. 19/195 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 532 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2023-11-19 07:57:50,745 INFO L119 LiptonReduction]: Number of co-enabled transitions 9000 [2023-11-19 07:57:53,834 INFO L134 LiptonReduction]: Checked pairs total: 26276 [2023-11-19 07:57:53,834 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-11-19 07:57:53,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:57:53,837 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;@6a01c977, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:57:53,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-19 07:57:53,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:57:53,839 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:57:53,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:57:53,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:53,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:57:53,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 07:57:53,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 27875, now seen corresponding path program 1 times [2023-11-19 07:57:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181439803] [2023-11-19 07:57:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181439803] [2023-11-19 07:57:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181439803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277870502] [2023-11-19 07:57:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:53,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:53,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:53,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 263 [2023-11-19 07:57:53,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:53,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:53,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 263 [2023-11-19 07:57:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:54,598 INFO L124 PetriNetUnfolderBase]: 2603/4509 cut-off events. [2023-11-19 07:57:54,598 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2023-11-19 07:57:54,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8007 conditions, 4509 events. 2603/4509 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 31143 event pairs, 1817 based on Foata normal form. 661/4429 useless extension candidates. Maximal degree in co-relation 994. Up to 3352 conditions per place. [2023-11-19 07:57:54,653 INFO L140 encePairwiseOnDemand]: 253/263 looper letters, 22 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-11-19 07:57:54,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 160 flow [2023-11-19 07:57:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-11-19 07:57:54,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816223067173637 [2023-11-19 07:57:54,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-11-19 07:57:54,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-11-19 07:57:54,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:54,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-11-19 07:57:54,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:54,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:54,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:54,664 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 132 flow. Second operand 3 states and 380 transitions. [2023-11-19 07:57:54,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 160 flow [2023-11-19 07:57:54,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 158 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 07:57:54,668 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 114 flow [2023-11-19 07:57:54,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-11-19 07:57:54,673 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2023-11-19 07:57:54,674 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 114 flow [2023-11-19 07:57:54,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:54,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:54,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:57:54,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:57:54,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 07:57:54,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash 27874, now seen corresponding path program 1 times [2023-11-19 07:57:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:54,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011960032] [2023-11-19 07:57:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:54,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011960032] [2023-11-19 07:57:54,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011960032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:54,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:54,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783408211] [2023-11-19 07:57:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:54,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:54,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:54,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 263 [2023-11-19 07:57:54,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:54,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:54,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 263 [2023-11-19 07:57:54,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:55,167 INFO L124 PetriNetUnfolderBase]: 1653/2929 cut-off events. [2023-11-19 07:57:55,167 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2023-11-19 07:57:55,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5196 conditions, 2929 events. 1653/2929 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 19018 event pairs, 1128 based on Foata normal form. 0/2601 useless extension candidates. Maximal degree in co-relation 5187. Up to 2150 conditions per place. [2023-11-19 07:57:55,204 INFO L140 encePairwiseOnDemand]: 261/263 looper letters, 21 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-11-19 07:57:55,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 156 flow [2023-11-19 07:57:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-11-19 07:57:55,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47782002534854245 [2023-11-19 07:57:55,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-11-19 07:57:55,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-11-19 07:57:55,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:55,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-11-19 07:57:55,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:55,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:55,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:55,212 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 114 flow. Second operand 3 states and 377 transitions. [2023-11-19 07:57:55,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 156 flow [2023-11-19 07:57:55,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 155 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:55,220 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 113 flow [2023-11-19 07:57:55,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-11-19 07:57:55,221 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2023-11-19 07:57:55,221 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 113 flow [2023-11-19 07:57:55,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:55,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:55,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:55,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:57:55,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 07:57:55,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2084837953, now seen corresponding path program 1 times [2023-11-19 07:57:55,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127093004] [2023-11-19 07:57:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127093004] [2023-11-19 07:57:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127093004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:57:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339607184] [2023-11-19 07:57:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:55,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:55,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:55,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:55,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 263 [2023-11-19 07:57:55,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:55,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:55,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 263 [2023-11-19 07:57:55,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:55,939 INFO L124 PetriNetUnfolderBase]: 2912/4700 cut-off events. [2023-11-19 07:57:55,939 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2023-11-19 07:57:55,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8826 conditions, 4700 events. 2912/4700 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 30045 event pairs, 779 based on Foata normal form. 275/4740 useless extension candidates. Maximal degree in co-relation 8816. Up to 2935 conditions per place. [2023-11-19 07:57:55,991 INFO L140 encePairwiseOnDemand]: 256/263 looper letters, 43 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-11-19 07:57:55,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 255 flow [2023-11-19 07:57:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-11-19 07:57:55,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5044359949302915 [2023-11-19 07:57:55,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-11-19 07:57:55,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-11-19 07:57:55,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:55,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-11-19 07:57:55,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:55,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:56,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:56,000 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 113 flow. Second operand 3 states and 398 transitions. [2023-11-19 07:57:56,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 255 flow [2023-11-19 07:57:56,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:56,003 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 142 flow [2023-11-19 07:57:56,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-11-19 07:57:56,005 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2023-11-19 07:57:56,005 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 142 flow [2023-11-19 07:57:56,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:56,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:56,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:56,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:57:56,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 07:57:56,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:56,007 INFO L85 PathProgramCache]: Analyzing trace with hash 204478792, now seen corresponding path program 1 times [2023-11-19 07:57:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813765359] [2023-11-19 07:57:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813765359] [2023-11-19 07:57:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813765359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:57:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683319806] [2023-11-19 07:57:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:56,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:57:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:56,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:57:56,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:57:56,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 263 [2023-11-19 07:57:56,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:56,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:56,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 263 [2023-11-19 07:57:56,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:57,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([809] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_21|, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of3ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post2#1_29|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of3ForFork0_Barrier2_#t~post2#1][60], [139#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, 37#L709-5true, 143#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread2of3ForFork0InUse, Black: 147#(= ~COND~0 0), 49#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, thr1Thread3of3ForFork0InUse, 46#L699-3true, 152#(= ~count~0 0), 54#L699-3true]) [2023-11-19 07:57:57,298 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-19 07:57:57,298 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:57:57,299 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:57:57,299 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-19 07:57:57,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([670] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][69], [139#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, 154#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 101#L699-3true, 37#L709-5true, Black: 147#(= ~COND~0 0), 143#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#true, 70#L697true, 54#L699-3true]) [2023-11-19 07:57:57,311 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 07:57:57,311 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 07:57:57,311 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:57:57,312 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 07:57:57,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([809] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_21|, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of3ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post2#1_29|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of3ForFork0_Barrier2_#t~post2#1][60], [139#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, Black: 147#(= ~COND~0 0), 143#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread2of3ForFork0InUse, 49#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, thr1Thread3of3ForFork0InUse, 46#L699-3true, 43#L709-4true, 152#(= ~count~0 0), 54#L699-3true]) [2023-11-19 07:57:57,414 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-11-19 07:57:57,415 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:57:57,415 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:57:57,415 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-19 07:57:57,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([670] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][69], [139#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, 154#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), 101#L699-3true, 143#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 147#(= ~COND~0 0), thr1Thread2of3ForFork0InUse, 145#true, thr1Thread3of3ForFork0InUse, 70#L697true, 43#L709-4true, 54#L699-3true]) [2023-11-19 07:57:57,424 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:57:57,425 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 07:57:57,425 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 07:57:57,425 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 07:57:57,462 INFO L124 PetriNetUnfolderBase]: 5535/9971 cut-off events. [2023-11-19 07:57:57,463 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2023-11-19 07:57:57,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18604 conditions, 9971 events. 5535/9971 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 83518 event pairs, 1320 based on Foata normal form. 368/9833 useless extension candidates. Maximal degree in co-relation 18592. Up to 2922 conditions per place. [2023-11-19 07:57:57,561 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 88 selfloop transitions, 18 changer transitions 0/128 dead transitions. [2023-11-19 07:57:57,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 128 transitions, 540 flow [2023-11-19 07:57:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:57:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:57:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2023-11-19 07:57:57,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4866920152091255 [2023-11-19 07:57:57,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2023-11-19 07:57:57,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2023-11-19 07:57:57,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:57,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2023-11-19 07:57:57,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:57,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:57,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 263.0) internal successors, (1841), 7 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:57,575 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 142 flow. Second operand 6 states and 768 transitions. [2023-11-19 07:57:57,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 128 transitions, 540 flow [2023-11-19 07:57:57,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 128 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:57,582 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 285 flow [2023-11-19 07:57:57,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2023-11-19 07:57:57,583 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-11-19 07:57:57,584 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 285 flow [2023-11-19 07:57:57,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:57,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:57,584 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 07:57:57,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:57:57,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 07:57:57,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1065613106, now seen corresponding path program 1 times [2023-11-19 07:57:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786629627] [2023-11-19 07:57:57,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:57,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:57:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:57,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:57:57,627 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:57:57,627 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-11-19 07:57:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2023-11-19 07:57:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2023-11-19 07:57:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2023-11-19 07:57:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2023-11-19 07:57:57,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2023-11-19 07:57:57,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2023-11-19 07:57:57,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2023-11-19 07:57:57,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:57:57,629 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-19 07:57:57,631 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:57:57,631 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-19 07:57:57,748 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:57:57,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 174 transitions, 376 flow [2023-11-19 07:57:57,785 INFO L124 PetriNetUnfolderBase]: 25/244 cut-off events. [2023-11-19 07:57:57,785 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:57:57,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 244 events. 25/244 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 715 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 203. Up to 10 conditions per place. [2023-11-19 07:57:57,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 174 transitions, 376 flow [2023-11-19 07:57:57,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 174 transitions, 376 flow [2023-11-19 07:57:57,790 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:57:57,790 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 174 transitions, 376 flow [2023-11-19 07:57:57,790 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 174 transitions, 376 flow [2023-11-19 07:57:57,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 174 transitions, 376 flow [2023-11-19 07:57:57,823 INFO L124 PetriNetUnfolderBase]: 25/244 cut-off events. [2023-11-19 07:57:57,823 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 07:57:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 244 events. 25/244 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 715 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 203. Up to 10 conditions per place. [2023-11-19 07:57:57,840 INFO L119 LiptonReduction]: Number of co-enabled transitions 15720 [2023-11-19 07:58:01,123 INFO L134 LiptonReduction]: Checked pairs total: 48377 [2023-11-19 07:58:01,123 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-11-19 07:58:01,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:58:01,127 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;@6a01c977, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:58:01,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-19 07:58:01,129 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:58:01,129 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-19 07:58:01,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:01,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:01,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:58:01,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-19 07:58:01,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 39068, now seen corresponding path program 1 times [2023-11-19 07:58:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:01,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814457724] [2023-11-19 07:58:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:58:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:01,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814457724] [2023-11-19 07:58:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814457724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:01,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:01,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:58:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187241029] [2023-11-19 07:58:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:01,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:58:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:01,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:58:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:58:01,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 319 [2023-11-19 07:58:01,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 174 flow. Second operand has 2 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:01,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:01,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 319 [2023-11-19 07:58:01,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:06,153 INFO L124 PetriNetUnfolderBase]: 28298/43665 cut-off events. [2023-11-19 07:58:06,154 INFO L125 PetriNetUnfolderBase]: For 4117/4117 co-relation queries the response was YES. [2023-11-19 07:58:06,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79468 conditions, 43665 events. 28298/43665 cut-off events. For 4117/4117 co-relation queries the response was YES. Maximal size of possible extension queue 2057. Compared 354006 event pairs, 21641 based on Foata normal form. 5455/40368 useless extension candidates. Maximal degree in co-relation 10702. Up to 34350 conditions per place. [2023-11-19 07:58:06,631 INFO L140 encePairwiseOnDemand]: 309/319 looper letters, 32 selfloop transitions, 0 changer transitions 0/63 dead transitions. [2023-11-19 07:58:06,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 218 flow [2023-11-19 07:58:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:58:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:58:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 338 transitions. [2023-11-19 07:58:06,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297805642633229 [2023-11-19 07:58:06,634 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 338 transitions. [2023-11-19 07:58:06,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 338 transitions. [2023-11-19 07:58:06,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:06,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 338 transitions. [2023-11-19 07:58:06,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.0) internal successors, (338), 2 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:06,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:06,640 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:06,640 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 174 flow. Second operand 2 states and 338 transitions. [2023-11-19 07:58:06,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 218 flow [2023-11-19 07:58:06,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 212 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 07:58:06,655 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 148 flow [2023-11-19 07:58:06,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2023-11-19 07:58:06,657 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2023-11-19 07:58:06,657 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 148 flow [2023-11-19 07:58:06,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:06,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:06,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:58:06,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:58:06,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-19 07:58:06,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash 39058, now seen corresponding path program 1 times [2023-11-19 07:58:06,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:06,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672642222] [2023-11-19 07:58:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:58:06,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:06,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672642222] [2023-11-19 07:58:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672642222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:06,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:06,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:58:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326407098] [2023-11-19 07:58:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:06,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:06,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:06,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 319 [2023-11-19 07:58:06,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:06,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:06,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 319 [2023-11-19 07:58:06,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:10,041 INFO L124 PetriNetUnfolderBase]: 20846/32582 cut-off events. [2023-11-19 07:58:10,041 INFO L125 PetriNetUnfolderBase]: For 2316/2316 co-relation queries the response was YES. [2023-11-19 07:58:10,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58875 conditions, 32582 events. 20846/32582 cut-off events. For 2316/2316 co-relation queries the response was YES. Maximal size of possible extension queue 1559. Compared 259340 event pairs, 15853 based on Foata normal form. 0/26799 useless extension candidates. Maximal degree in co-relation 58868. Up to 25384 conditions per place. [2023-11-19 07:58:10,331 INFO L140 encePairwiseOnDemand]: 317/319 looper letters, 30 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-11-19 07:58:10,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 208 flow [2023-11-19 07:58:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:58:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-11-19 07:58:10,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754440961337513 [2023-11-19 07:58:10,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-11-19 07:58:10,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-11-19 07:58:10,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:10,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-11-19 07:58:10,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:10,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:10,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:10,341 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 148 flow. Second operand 3 states and 455 transitions. [2023-11-19 07:58:10,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 208 flow [2023-11-19 07:58:10,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:58:10,355 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 148 flow [2023-11-19 07:58:10,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-11-19 07:58:10,357 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2023-11-19 07:58:10,357 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 148 flow [2023-11-19 07:58:10,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:10,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:10,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 07:58:10,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:58:10,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-19 07:58:10,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash 39059, now seen corresponding path program 1 times [2023-11-19 07:58:10,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:10,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266996619] [2023-11-19 07:58:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:58:10,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:10,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266996619] [2023-11-19 07:58:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266996619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:10,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:10,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:58:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226244276] [2023-11-19 07:58:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:10,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:10,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:10,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 319 [2023-11-19 07:58:10,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:10,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:10,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 319 [2023-11-19 07:58:10,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:12,547 INFO L124 PetriNetUnfolderBase]: 13394/21499 cut-off events. [2023-11-19 07:58:12,547 INFO L125 PetriNetUnfolderBase]: For 2316/2316 co-relation queries the response was YES. [2023-11-19 07:58:12,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38829 conditions, 21499 events. 13394/21499 cut-off events. For 2316/2316 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 166898 event pairs, 10065 based on Foata normal form. 0/18685 useless extension candidates. Maximal degree in co-relation 38821. Up to 16419 conditions per place. [2023-11-19 07:58:12,730 INFO L140 encePairwiseOnDemand]: 317/319 looper letters, 29 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2023-11-19 07:58:12,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 206 flow [2023-11-19 07:58:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:58:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-11-19 07:58:12,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48066875653082547 [2023-11-19 07:58:12,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-11-19 07:58:12,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-11-19 07:58:12,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:12,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-11-19 07:58:12,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:12,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:12,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:12,742 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 148 flow. Second operand 3 states and 460 transitions. [2023-11-19 07:58:12,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 206 flow [2023-11-19 07:58:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:58:12,752 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 147 flow [2023-11-19 07:58:12,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-11-19 07:58:12,753 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2023-11-19 07:58:12,753 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 147 flow [2023-11-19 07:58:12,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:12,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:12,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:12,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:58:12,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-19 07:58:12,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash 883249489, now seen corresponding path program 1 times [2023-11-19 07:58:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225723760] [2023-11-19 07:58:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:58:12,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225723760] [2023-11-19 07:58:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225723760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:58:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257495120] [2023-11-19 07:58:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:12,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:12,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 319 [2023-11-19 07:58:12,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:12,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:12,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 319 [2023-11-19 07:58:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:17,111 INFO L124 PetriNetUnfolderBase]: 33364/47590 cut-off events. [2023-11-19 07:58:17,111 INFO L125 PetriNetUnfolderBase]: For 2349/2349 co-relation queries the response was YES. [2023-11-19 07:58:17,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90985 conditions, 47590 events. 33364/47590 cut-off events. For 2349/2349 co-relation queries the response was YES. Maximal size of possible extension queue 2102. Compared 342029 event pairs, 7678 based on Foata normal form. 1481/44932 useless extension candidates. Maximal degree in co-relation 90977. Up to 34931 conditions per place. [2023-11-19 07:58:17,473 INFO L140 encePairwiseOnDemand]: 310/319 looper letters, 60 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2023-11-19 07:58:17,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 346 flow [2023-11-19 07:58:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:58:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-11-19 07:58:17,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078369905956113 [2023-11-19 07:58:17,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-11-19 07:58:17,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-11-19 07:58:17,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:17,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-11-19 07:58:17,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:17,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:17,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 319.0) internal successors, (1276), 4 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:17,482 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 147 flow. Second operand 3 states and 486 transitions. [2023-11-19 07:58:17,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 346 flow [2023-11-19 07:58:17,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:58:17,488 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 185 flow [2023-11-19 07:58:17,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2023-11-19 07:58:17,489 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -2 predicate places. [2023-11-19 07:58:17,489 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 185 flow [2023-11-19 07:58:17,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:17,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:17,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:17,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:58:17,490 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-19 07:58:17,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:17,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1609809466, now seen corresponding path program 1 times [2023-11-19 07:58:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:17,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18210890] [2023-11-19 07:58:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:58:17,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:17,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18210890] [2023-11-19 07:58:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18210890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:17,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:17,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:58:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738094622] [2023-11-19 07:58:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:17,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:58:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:58:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:58:17,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 319 [2023-11-19 07:58:17,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:17,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:17,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 319 [2023-11-19 07:58:17,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:20,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 29#L699-3true, 32#L699-3true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:20,817 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-19 07:58:20,817 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:58:20,818 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-19 07:58:20,818 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-19 07:58:23,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 29#L699-3true, 32#L699-3true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 54#L709-4true, 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:23,124 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-11-19 07:58:23,124 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-19 07:58:23,124 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:58:23,124 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:58:23,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 29#L699-3true, 110#$Ultimate##0true, 32#L699-3true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:23,212 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:58:23,213 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:58:23,213 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:58:23,213 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:58:24,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 32#L699-3true, 102#$Ultimate##0true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 155#L699-3true, 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:24,146 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-19 07:58:24,146 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:58:24,146 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:58:24,146 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:58:24,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 29#L699-3true, 32#L699-3true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 49#L692-1true, 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:24,229 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:58:24,229 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:58:24,229 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:58:24,229 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:58:24,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1170] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_29|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_31|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_29|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_33|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base][121], [thr1Thread3of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 32#L699-3true, 77#$Ultimate##0true, 50#L709-5true, 155#L699-3true, 52#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:24,303 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 07:58:24,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:58:24,303 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:58:24,303 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 07:58:24,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1170] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_29|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_31|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_29|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_33|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base][121], [thr1Thread3of4ForFork0InUse, 139#$Ultimate##0true, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 50#L709-5true, 155#L699-3true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 52#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 78#L699-3true, 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:24,382 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-19 07:58:24,382 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-19 07:58:24,382 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:58:24,382 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:58:25,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 32#L699-3true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 155#L699-3true, 183#(= ~count~0 0), 27#L692-1true, Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:25,425 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-19 07:58:25,425 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:58:25,425 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:58:25,425 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:58:25,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 29#L699-3true, 32#L699-3true, 50#L709-5true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 183#(= ~count~0 0), 106#L693-1true, Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:25,537 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:58:25,537 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:25,537 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:58:25,537 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:58:25,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1170] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_29|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_31|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_29|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_33|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base][121], [thr1Thread3of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread4of4ForFork0InUse, 59#L692-1true, 32#L699-3true, 50#L709-5true, 155#L699-3true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 52#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:25,620 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:58:25,620 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:58:25,620 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:58:25,620 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 07:58:25,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1170] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_29|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_31|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_29|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_33|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base][121], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 104#L692-1true, 50#L709-5true, 52#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 155#L699-3true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 78#L699-3true, 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:25,698 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-19 07:58:25,698 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-19 07:58:25,698 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:58:25,698 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:58:25,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1170] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1_29|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset_31|, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1_29|, thr1Thread3of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread3of4ForFork0_Barrier2_#t~post2#1_33|, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base_31|} AuxVars[] AssignedVars[thr1Thread3of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread3of4ForFork0_Barrier2_#t~post2#1, thr1Thread3of4ForFork0_reach_error_#t~nondet0#1.base][135], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 50#L709-5true, 187#(and (= ~count~0 0) (= |thr1Thread1of4ForFork0_Barrier2_#t~post2#1| 0)), 151#L693-1true, 155#L699-3true, 52#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 178#(= ~COND~0 0), 78#L699-3true, 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:25,699 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 07:58:25,699 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:58:25,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:25,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 110#$Ultimate##0true, 29#L699-3true, 32#L699-3true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 54#L709-4true, 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:26,244 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,244 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,244 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:58:26,244 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:58:26,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([994] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 32#L699-3true, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 155#L699-3true, 146#L697true, 185#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 178#(= ~COND~0 0), 78#L699-3true, 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:26,320 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:58:26,320 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 07:58:26,321 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,321 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([994] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 29#L699-3true, 32#L699-3true, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 155#L699-3true, 185#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 178#(= ~COND~0 0), 78#L699-3true, 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:26,715 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:58:26,715 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,715 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,715 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,757 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([994] L699-2-->L699-3: Formula: (not (= (mod v_~COND~0_2 256) 0)) InVars {~COND~0=v_~COND~0_2} OutVars{~COND~0=v_~COND~0_2} AuxVars[] AssignedVars[][72], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 32#L699-3true, 29#L699-3true, 50#L709-5true, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 155#L699-3true, 185#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 178#(= ~COND~0 0), 78#L699-3true, 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:26,758 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 07:58:26,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,758 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 07:58:26,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 07:58:26,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] L691-->thr1Err0ASSERT_VIOLATIONMEMORY_LEAK: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1_25|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset_21|, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1_25|, thr1Thread2of4ForFork0_Barrier2_#t~post2#1=|v_thr1Thread2of4ForFork0_Barrier2_#t~post2#1_29|, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base_21|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_Barrier2_#t~nondet1#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of4ForFork0_Barrier2_#t~nondet3#1, thr1Thread2of4ForFork0_Barrier2_#t~post2#1, thr1Thread2of4ForFork0_reach_error_#t~nondet0#1.base][62], [thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 170#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 32#L699-3true, 145#L693-1true, 50#L709-5true, 133#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 174#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 155#L699-3true, 183#(= ~count~0 0), Black: 178#(= ~COND~0 0), 165#true, 176#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse]) [2023-11-19 07:58:26,801 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-11-19 07:58:26,802 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-19 07:58:26,802 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-19 07:58:26,802 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event