./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/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_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/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_b6b97a61-9353-41d4-a0ff-22ea627a2773/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 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:02:18,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:02:19,079 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:02:19,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:02:19,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:02:19,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:02:19,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:02:19,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:02:19,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:02:19,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:02:19,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:02:19,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:02:19,136 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:02:19,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:02:19,138 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:02:19,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:02:19,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:02:19,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:02:19,140 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:02:19,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:02:19,140 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:02:19,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:02:19,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:02:19,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:02:19,144 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:02:19,144 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:02:19,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:02:19,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:02:19,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:02:19,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:19,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:02:19,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:02:19,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:02:19,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:02:19,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:02:19,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:02:19,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:02:19,149 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:02:19,150 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_b6b97a61-9353-41d4-a0ff-22ea627a2773/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_b6b97a61-9353-41d4-a0ff-22ea627a2773/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 -> 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 [2023-11-19 08:02:19,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:02:19,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:02:19,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:02:19,493 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:02:19,493 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:02:19,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2023-11-19 08:02:22,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:02:22,923 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:02:22,923 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2023-11-19 08:02:22,944 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/data/482aa90ad/00a7ba305be241da961da3f8d9cc90fb/FLAG4abb49ac6 [2023-11-19 08:02:22,963 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/data/482aa90ad/00a7ba305be241da961da3f8d9cc90fb [2023-11-19 08:02:22,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:02:22,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:02:22,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:22,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:02:22,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:02:22,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:22" (1/1) ... [2023-11-19 08:02:22,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d099b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:22, skipping insertion in model container [2023-11-19 08:02:22,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:22" (1/1) ... [2023-11-19 08:02:23,064 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:02:23,341 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 08:02:23,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:23,565 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:02:23,594 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 08:02:23,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:23,666 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:02:23,666 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:02:23,666 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:02:23,673 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:02:23,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23 WrapperNode [2023-11-19 08:02:23,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:23,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:23,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:02:23,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:02:23,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,735 INFO L138 Inliner]: procedures = 174, calls = 26, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 80 [2023-11-19 08:02:23,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:23,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:02:23,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:02:23,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:02:23,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:02:23,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:02:23,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:02:23,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:02:23,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (1/1) ... [2023-11-19 08:02:23,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:23,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:23,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:02:23,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6b97a61-9353-41d4-a0ff-22ea627a2773/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:02:23,862 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-19 08:02:23,862 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-19 08:02:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:02:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:02:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:02:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:02:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:02:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:02:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:02:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:02:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:02:23,869 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 08:02:24,074 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:02:24,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:02:24,364 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:02:24,489 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:02:24,490 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 08:02:24,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:24 BoogieIcfgContainer [2023-11-19 08:02:24,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:02:24,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:02:24,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:02:24,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:02:24,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:02:22" (1/3) ... [2023-11-19 08:02:24,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daeb31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:24, skipping insertion in model container [2023-11-19 08:02:24,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:23" (2/3) ... [2023-11-19 08:02:24,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daeb31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:24, skipping insertion in model container [2023-11-19 08:02:24,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:24" (3/3) ... [2023-11-19 08:02:24,507 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-11-19 08:02:24,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:02:24,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 08:02:24,530 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:02:24,630 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:24,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 60 transitions, 124 flow [2023-11-19 08:02:24,727 INFO L124 PetriNetUnfolderBase]: 5/76 cut-off events. [2023-11-19 08:02:24,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:24,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 5/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-19 08:02:24,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 60 transitions, 124 flow [2023-11-19 08:02:24,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 60 transitions, 124 flow [2023-11-19 08:02:24,746 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:24,765 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 60 transitions, 124 flow [2023-11-19 08:02:24,771 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 60 transitions, 124 flow [2023-11-19 08:02:24,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 60 transitions, 124 flow [2023-11-19 08:02:24,810 INFO L124 PetriNetUnfolderBase]: 5/76 cut-off events. [2023-11-19 08:02:24,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:24,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 5/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-19 08:02:24,813 INFO L119 LiptonReduction]: Number of co-enabled transitions 1026 [2023-11-19 08:02:27,284 INFO L134 LiptonReduction]: Checked pairs total: 947 [2023-11-19 08:02:27,285 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-11-19 08:02:27,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:27,307 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;@1c92f727, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:27,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 08:02:27,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:27,310 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:02:27,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:27,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:27,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:27,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 08:02:27,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash 11887, now seen corresponding path program 1 times [2023-11-19 08:02:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:27,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670788657] [2023-11-19 08:02:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:27,506 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 08:02:27,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670788657] [2023-11-19 08:02:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670788657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812617974] [2023-11-19 08:02:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:27,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:27,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:27,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:27,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2023-11-19 08:02:27,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 11 transitions, 26 flow. Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 08:02:27,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:27,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2023-11-19 08:02:27,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:27,594 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2023-11-19 08:02:27,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 4 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 26. Up to 19 conditions per place. [2023-11-19 08:02:27,596 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-11-19 08:02:27,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 8 transitions, 34 flow [2023-11-19 08:02:27,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2023-11-19 08:02:27,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2023-11-19 08:02:27,613 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 106 transitions. [2023-11-19 08:02:27,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 106 transitions. [2023-11-19 08:02:27,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:27,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 106 transitions. [2023-11-19 08:02:27,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 08:02:27,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 08:02:27,630 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 08:02:27,632 INFO L175 Difference]: Start difference. First operand has 14 places, 11 transitions, 26 flow. Second operand 2 states and 106 transitions. [2023-11-19 08:02:27,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 8 transitions, 34 flow [2023-11-19 08:02:27,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 12 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:27,638 INFO L231 Difference]: Finished difference. Result has 12 places, 8 transitions, 20 flow [2023-11-19 08:02:27,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=20, PETRI_PLACES=12, PETRI_TRANSITIONS=8} [2023-11-19 08:02:27,645 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -2 predicate places. [2023-11-19 08:02:27,646 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 8 transitions, 20 flow [2023-11-19 08:02:27,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 08:02:27,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:27,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:27,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:02:27,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 08:02:27,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 11897, now seen corresponding path program 1 times [2023-11-19 08:02:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:27,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233338807] [2023-11-19 08:02:27,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:27,835 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 08:02:27,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:27,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233338807] [2023-11-19 08:02:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233338807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:27,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867532061] [2023-11-19 08:02:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:27,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:27,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:27,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 126 [2023-11-19 08:02:27,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 8 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 08:02:27,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:27,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 126 [2023-11-19 08:02:27,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:27,892 INFO L124 PetriNetUnfolderBase]: 3/15 cut-off events. [2023-11-19 08:02:27,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:27,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 15 events. 3/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 3 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 31. Up to 14 conditions per place. [2023-11-19 08:02:27,893 INFO L140 encePairwiseOnDemand]: 124/126 looper letters, 5 selfloop transitions, 1 changer transitions 0/7 dead transitions. [2023-11-19 08:02:27,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 7 transitions, 30 flow [2023-11-19 08:02:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-19 08:02:27,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2023-11-19 08:02:27,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-19 08:02:27,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-19 08:02:27,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:27,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-19 08:02:27,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 08:02:27,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:27,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:27,909 INFO L175 Difference]: Start difference. First operand has 12 places, 8 transitions, 20 flow. Second operand 3 states and 136 transitions. [2023-11-19 08:02:27,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 7 transitions, 30 flow [2023-11-19 08:02:27,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 7 transitions, 30 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:27,913 INFO L231 Difference]: Finished difference. Result has 13 places, 7 transitions, 20 flow [2023-11-19 08:02:27,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20, PETRI_PLACES=13, PETRI_TRANSITIONS=7} [2023-11-19 08:02:27,915 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-11-19 08:02:27,916 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 7 transitions, 20 flow [2023-11-19 08:02:27,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 08:02:27,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:27,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:27,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:02:27,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 08:02:27,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash 11896, now seen corresponding path program 1 times [2023-11-19 08:02:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:27,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817996514] [2023-11-19 08:02:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:28,043 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 08:02:28,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817996514] [2023-11-19 08:02:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817996514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:28,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105140111] [2023-11-19 08:02:28,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:28,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:28,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:28,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:28,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 126 [2023-11-19 08:02:28,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 7 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 08:02:28,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:28,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 126 [2023-11-19 08:02:28,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:28,088 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-11-19 08:02:28,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:28,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 24. Up to 10 conditions per place. [2023-11-19 08:02:28,089 INFO L140 encePairwiseOnDemand]: 124/126 looper letters, 4 selfloop transitions, 1 changer transitions 0/6 dead transitions. [2023-11-19 08:02:28,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 6 transitions, 28 flow [2023-11-19 08:02:28,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-19 08:02:28,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3412698412698413 [2023-11-19 08:02:28,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-19 08:02:28,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-19 08:02:28,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:28,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-19 08:02:28,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 08:02:28,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:28,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:28,096 INFO L175 Difference]: Start difference. First operand has 13 places, 7 transitions, 20 flow. Second operand 3 states and 129 transitions. [2023-11-19 08:02:28,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 6 transitions, 28 flow [2023-11-19 08:02:28,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:28,097 INFO L231 Difference]: Finished difference. Result has 13 places, 6 transitions, 19 flow [2023-11-19 08:02:28,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=19, PETRI_PLACES=13, PETRI_TRANSITIONS=6} [2023-11-19 08:02:28,098 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-11-19 08:02:28,098 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 6 transitions, 19 flow [2023-11-19 08:02:28,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 08:02:28,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:28,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-19 08:02:28,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:02:28,099 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 08:02:28,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash 11440152, now seen corresponding path program 1 times [2023-11-19 08:02:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:28,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031701237] [2023-11-19 08:02:28,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:28,245 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 08:02:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031701237] [2023-11-19 08:02:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031701237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:28,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329673493] [2023-11-19 08:02:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:28,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:28,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:28,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:28,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 126 [2023-11-19 08:02:28,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 6 transitions, 19 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 08:02:28,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:28,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 126 [2023-11-19 08:02:28,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:28,272 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-19 08:02:28,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:28,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-11-19 08:02:28,273 INFO L140 encePairwiseOnDemand]: 124/126 looper letters, 3 selfloop transitions, 1 changer transitions 0/5 dead transitions. [2023-11-19 08:02:28,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 5 transitions, 25 flow [2023-11-19 08:02:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-19 08:02:28,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2023-11-19 08:02:28,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-19 08:02:28,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-19 08:02:28,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:28,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-19 08:02:28,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 08:02:28,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:28,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:28,279 INFO L175 Difference]: Start difference. First operand has 13 places, 6 transitions, 19 flow. Second operand 3 states and 140 transitions. [2023-11-19 08:02:28,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 5 transitions, 25 flow [2023-11-19 08:02:28,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 5 transitions, 24 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:28,280 INFO L231 Difference]: Finished difference. Result has 13 places, 5 transitions, 18 flow [2023-11-19 08:02:28,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18, PETRI_PLACES=13, PETRI_TRANSITIONS=5} [2023-11-19 08:02:28,281 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-11-19 08:02:28,281 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 5 transitions, 18 flow [2023-11-19 08:02:28,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 08:02:28,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:28,282 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 08:02:28,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:02:28,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-19 08:02:28,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1890960982, now seen corresponding path program 1 times [2023-11-19 08:02:28,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:28,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493266084] [2023-11-19 08:02:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:28,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:02:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:28,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:02:28,320 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:02:28,321 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-19 08:02:28,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2023-11-19 08:02:28,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-19 08:02:28,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-19 08:02:28,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2023-11-19 08:02:28,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2023-11-19 08:02:28,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:02:28,325 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-19 08:02:28,328 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:02:28,328 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 08:02:28,346 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:28,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 88 transitions, 186 flow [2023-11-19 08:02:28,370 INFO L124 PetriNetUnfolderBase]: 9/122 cut-off events. [2023-11-19 08:02:28,370 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:02:28,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 122 events. 9/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 313 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2023-11-19 08:02:28,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 88 transitions, 186 flow [2023-11-19 08:02:28,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 88 transitions, 186 flow [2023-11-19 08:02:28,374 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:28,374 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 88 transitions, 186 flow [2023-11-19 08:02:28,375 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 88 transitions, 186 flow [2023-11-19 08:02:28,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 88 transitions, 186 flow [2023-11-19 08:02:28,393 INFO L124 PetriNetUnfolderBase]: 9/122 cut-off events. [2023-11-19 08:02:28,394 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:02:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 122 events. 9/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 313 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2023-11-19 08:02:28,401 INFO L119 LiptonReduction]: Number of co-enabled transitions 3564 [2023-11-19 08:02:29,538 INFO L134 LiptonReduction]: Checked pairs total: 11283 [2023-11-19 08:02:29,539 INFO L136 LiptonReduction]: Total number of compositions: 74 [2023-11-19 08:02:29,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:29,543 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;@1c92f727, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:29,543 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 08:02:29,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:29,544 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:02:29,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:29,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:29,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:29,545 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 08:02:29,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash 18057, now seen corresponding path program 1 times [2023-11-19 08:02:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674856192] [2023-11-19 08:02:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:29,561 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 08:02:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674856192] [2023-11-19 08:02:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674856192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:29,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:29,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482418592] [2023-11-19 08:02:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:29,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:29,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 162 [2023-11-19 08:02:29,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 08:02:29,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:29,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 162 [2023-11-19 08:02:29,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:29,768 INFO L124 PetriNetUnfolderBase]: 561/1074 cut-off events. [2023-11-19 08:02:29,768 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-19 08:02:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2005 conditions, 1074 events. 561/1074 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6931 event pairs, 485 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 824. Up to 902 conditions per place. [2023-11-19 08:02:29,783 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 22 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-11-19 08:02:29,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 124 flow [2023-11-19 08:02:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2023-11-19 08:02:29,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2023-11-19 08:02:29,786 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 158 transitions. [2023-11-19 08:02:29,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 158 transitions. [2023-11-19 08:02:29,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:29,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 158 transitions. [2023-11-19 08:02:29,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 08:02:29,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 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 08:02:29,791 INFO L81 ComplementDD]: Finished complementDD. Result has 3 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 08:02:29,791 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 88 flow. Second operand 2 states and 158 transitions. [2023-11-19 08:02:29,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 124 flow [2023-11-19 08:02:29,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:29,793 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 80 flow [2023-11-19 08:02:29,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=39, PETRI_TRANSITIONS=35} [2023-11-19 08:02:29,799 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-19 08:02:29,799 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 80 flow [2023-11-19 08:02:29,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 08:02:29,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:29,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:29,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:02:29,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 08:02:29,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 18067, now seen corresponding path program 1 times [2023-11-19 08:02:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903689894] [2023-11-19 08:02:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:29,885 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 08:02:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903689894] [2023-11-19 08:02:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903689894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558379959] [2023-11-19 08:02:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:29,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:29,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 162 [2023-11-19 08:02:29,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 08:02:29,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:29,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 162 [2023-11-19 08:02:29,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:30,021 INFO L124 PetriNetUnfolderBase]: 402/791 cut-off events. [2023-11-19 08:02:30,021 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-19 08:02:30,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 791 events. 402/791 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4800 event pairs, 345 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1474. Up to 657 conditions per place. [2023-11-19 08:02:30,028 INFO L140 encePairwiseOnDemand]: 160/162 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-19 08:02:30,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 120 flow [2023-11-19 08:02:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2023-11-19 08:02:30,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218106995884774 [2023-11-19 08:02:30,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 205 transitions. [2023-11-19 08:02:30,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions. [2023-11-19 08:02:30,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:30,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions. [2023-11-19 08:02:30,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 08:02:30,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 08:02:30,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 08:02:30,034 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 80 flow. Second operand 3 states and 205 transitions. [2023-11-19 08:02:30,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 120 flow [2023-11-19 08:02:30,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:30,036 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 80 flow [2023-11-19 08:02:30,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=40, PETRI_TRANSITIONS=34} [2023-11-19 08:02:30,037 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-19 08:02:30,037 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 80 flow [2023-11-19 08:02:30,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 08:02:30,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:30,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:30,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:02:30,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 08:02:30,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 18066, now seen corresponding path program 1 times [2023-11-19 08:02:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189904709] [2023-11-19 08:02:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:30,061 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 08:02:30,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:30,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189904709] [2023-11-19 08:02:30,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189904709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:30,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:30,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436548011] [2023-11-19 08:02:30,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:30,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:30,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2023-11-19 08:02:30,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 08:02:30,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:30,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2023-11-19 08:02:30,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:30,177 INFO L124 PetriNetUnfolderBase]: 243/508 cut-off events. [2023-11-19 08:02:30,177 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-19 08:02:30,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 508 events. 243/508 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2822 event pairs, 205 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 948. Up to 413 conditions per place. [2023-11-19 08:02:30,182 INFO L140 encePairwiseOnDemand]: 160/162 looper letters, 19 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-11-19 08:02:30,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 118 flow [2023-11-19 08:02:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2023-11-19 08:02:30,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2023-11-19 08:02:30,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 198 transitions. [2023-11-19 08:02:30,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 198 transitions. [2023-11-19 08:02:30,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:30,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 198 transitions. [2023-11-19 08:02:30,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.0) internal successors, (198), 3 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 08:02:30,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 08:02:30,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 08:02:30,188 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 80 flow. Second operand 3 states and 198 transitions. [2023-11-19 08:02:30,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 118 flow [2023-11-19 08:02:30,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:30,190 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 79 flow [2023-11-19 08:02:30,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=40, PETRI_TRANSITIONS=33} [2023-11-19 08:02:30,190 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-19 08:02:30,191 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 79 flow [2023-11-19 08:02:30,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 08:02:30,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:30,191 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 08:02:30,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:02:30,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-19 08:02:30,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1176721479, now seen corresponding path program 1 times [2023-11-19 08:02:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:30,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672788968] [2023-11-19 08:02:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:30,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:02:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:30,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:02:30,241 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:02:30,242 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-19 08:02:30,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2023-11-19 08:02:30,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2023-11-19 08:02:30,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2023-11-19 08:02:30,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2023-11-19 08:02:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2023-11-19 08:02:30,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2023-11-19 08:02:30,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:02:30,243 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-19 08:02:30,244 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:02:30,244 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 08:02:30,265 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:30,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 250 flow [2023-11-19 08:02:30,290 INFO L124 PetriNetUnfolderBase]: 13/168 cut-off events. [2023-11-19 08:02:30,290 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:02:30,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 13/168 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 503 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2023-11-19 08:02:30,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 116 transitions, 250 flow [2023-11-19 08:02:30,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 116 transitions, 250 flow [2023-11-19 08:02:30,294 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:30,294 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 116 transitions, 250 flow [2023-11-19 08:02:30,294 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 116 transitions, 250 flow [2023-11-19 08:02:30,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 250 flow [2023-11-19 08:02:30,315 INFO L124 PetriNetUnfolderBase]: 13/168 cut-off events. [2023-11-19 08:02:30,316 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:02:30,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 13/168 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 503 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2023-11-19 08:02:30,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 7614 [2023-11-19 08:02:31,549 INFO L134 LiptonReduction]: Checked pairs total: 26798 [2023-11-19 08:02:31,549 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-11-19 08:02:31,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:31,552 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;@1c92f727, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:31,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-19 08:02:31,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:31,554 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:02:31,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:31,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:31,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:31,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 08:02:31,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash 25698, now seen corresponding path program 1 times [2023-11-19 08:02:31,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:31,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231782278] [2023-11-19 08:02:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:31,572 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 08:02:31,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231782278] [2023-11-19 08:02:31,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231782278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:31,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:31,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:31,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787353878] [2023-11-19 08:02:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:31,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:31,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 211 [2023-11-19 08:02:31,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 126 flow. Second operand has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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 08:02:31,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:31,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 211 [2023-11-19 08:02:31,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:33,127 INFO L124 PetriNetUnfolderBase]: 7162/11374 cut-off events. [2023-11-19 08:02:33,127 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2023-11-19 08:02:33,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21551 conditions, 11374 events. 7162/11374 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 85374 event pairs, 6210 based on Foata normal form. 0/9152 useless extension candidates. Maximal degree in co-relation 1818. Up to 9879 conditions per place. [2023-11-19 08:02:33,241 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 30 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-11-19 08:02:33,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 176 flow [2023-11-19 08:02:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2023-11-19 08:02:33,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48104265402843605 [2023-11-19 08:02:33,243 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2023-11-19 08:02:33,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2023-11-19 08:02:33,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:33,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2023-11-19 08:02:33,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 08:02:33,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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 08:02:33,246 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 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 08:02:33,246 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 126 flow. Second operand 2 states and 203 transitions. [2023-11-19 08:02:33,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 176 flow [2023-11-19 08:02:33,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 174 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:33,252 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 114 flow [2023-11-19 08:02:33,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-11-19 08:02:33,254 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-19 08:02:33,254 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 114 flow [2023-11-19 08:02:33,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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 08:02:33,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:33,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:33,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:02:33,255 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 08:02:33,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 25712, now seen corresponding path program 1 times [2023-11-19 08:02:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403901488] [2023-11-19 08:02:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:33,313 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 08:02:33,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403901488] [2023-11-19 08:02:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403901488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:33,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:33,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087894609] [2023-11-19 08:02:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:33,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:33,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 211 [2023-11-19 08:02:33,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 08:02:33,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:33,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 211 [2023-11-19 08:02:33,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:34,489 INFO L124 PetriNetUnfolderBase]: 5221/8413 cut-off events. [2023-11-19 08:02:34,489 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-11-19 08:02:34,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15904 conditions, 8413 events. 5221/8413 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 61307 event pairs, 4507 based on Foata normal form. 0/7063 useless extension candidates. Maximal degree in co-relation 15898. Up to 7258 conditions per place. [2023-11-19 08:02:34,566 INFO L140 encePairwiseOnDemand]: 209/211 looper letters, 28 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-11-19 08:02:34,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 170 flow [2023-11-19 08:02:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-11-19 08:02:34,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218009478672986 [2023-11-19 08:02:34,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-11-19 08:02:34,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-11-19 08:02:34,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:34,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-11-19 08:02:34,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 08:02:34,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 08:02:34,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 08:02:34,572 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 114 flow. Second operand 3 states and 267 transitions. [2023-11-19 08:02:34,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 170 flow [2023-11-19 08:02:34,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:34,577 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 114 flow [2023-11-19 08:02:34,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=55, PETRI_TRANSITIONS=48} [2023-11-19 08:02:34,578 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-19 08:02:34,578 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 114 flow [2023-11-19 08:02:34,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 08:02:34,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:34,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:34,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:02:34,579 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 08:02:34,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 25714, now seen corresponding path program 1 times [2023-11-19 08:02:34,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252511025] [2023-11-19 08:02:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:34,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 08:02:34,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252511025] [2023-11-19 08:02:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252511025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:34,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:34,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:34,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775508586] [2023-11-19 08:02:34,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:34,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:34,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:34,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:34,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 211 [2023-11-19 08:02:34,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 08:02:34,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:34,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 211 [2023-11-19 08:02:34,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:35,403 INFO L124 PetriNetUnfolderBase]: 3280/5452 cut-off events. [2023-11-19 08:02:35,404 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-11-19 08:02:35,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10325 conditions, 5452 events. 3280/5452 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 38227 event pairs, 2804 based on Foata normal form. 0/4974 useless extension candidates. Maximal degree in co-relation 10318. Up to 4638 conditions per place. [2023-11-19 08:02:35,460 INFO L140 encePairwiseOnDemand]: 209/211 looper letters, 27 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-11-19 08:02:35,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 168 flow [2023-11-19 08:02:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-11-19 08:02:35,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107424960505529 [2023-11-19 08:02:35,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-11-19 08:02:35,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-11-19 08:02:35,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:35,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-11-19 08:02:35,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 08:02:35,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 08:02:35,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 08:02:35,469 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 114 flow. Second operand 3 states and 260 transitions. [2023-11-19 08:02:35,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 168 flow [2023-11-19 08:02:35,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:35,473 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 113 flow [2023-11-19 08:02:35,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=55, PETRI_TRANSITIONS=47} [2023-11-19 08:02:35,476 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-19 08:02:35,476 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 113 flow [2023-11-19 08:02:35,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 08:02:35,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:35,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:35,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:02:35,477 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 08:02:35,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -568896821, now seen corresponding path program 1 times [2023-11-19 08:02:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:35,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060126406] [2023-11-19 08:02:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:35,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:35,616 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 08:02:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060126406] [2023-11-19 08:02:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060126406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:35,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:02:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028719046] [2023-11-19 08:02:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:35,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:35,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 211 [2023-11-19 08:02:35,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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 08:02:35,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:35,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 211 [2023-11-19 08:02:35,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:37,987 INFO L124 PetriNetUnfolderBase]: 12355/19121 cut-off events. [2023-11-19 08:02:37,987 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2023-11-19 08:02:38,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37590 conditions, 19121 events. 12355/19121 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 145180 event pairs, 2185 based on Foata normal form. 280/18732 useless extension candidates. Maximal degree in co-relation 37583. Up to 7379 conditions per place. [2023-11-19 08:02:38,148 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 130 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2023-11-19 08:02:38,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 168 transitions, 707 flow [2023-11-19 08:02:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:02:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:02:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2023-11-19 08:02:38,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448205822613406 [2023-11-19 08:02:38,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2023-11-19 08:02:38,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2023-11-19 08:02:38,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:38,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2023-11-19 08:02:38,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:38,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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 08:02:38,160 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 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 08:02:38,160 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 113 flow. Second operand 7 states and 657 transitions. [2023-11-19 08:02:38,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 168 transitions, 707 flow [2023-11-19 08:02:38,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 168 transitions, 706 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:38,167 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 326 flow [2023-11-19 08:02:38,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2023-11-19 08:02:38,168 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-11-19 08:02:38,168 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 326 flow [2023-11-19 08:02:38,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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 08:02:38,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:38,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:02:38,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 08:02:38,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash -331992690, now seen corresponding path program 1 times [2023-11-19 08:02:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558315666] [2023-11-19 08:02:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:38,248 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 08:02:38,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558315666] [2023-11-19 08:02:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558315666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092823214] [2023-11-19 08:02:38,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:38,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:38,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:38,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:38,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 211 [2023-11-19 08:02:38,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 08:02:38,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:38,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 211 [2023-11-19 08:02:38,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:39,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:39,880 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 08:02:39,881 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:39,881 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:39,881 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:39,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 51#L721true, thr1Thread3of3ForFork0InUse, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:39,890 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 08:02:39,890 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:39,895 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:39,895 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [8#L733-5true, 44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,174 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,174 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,174 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,174 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [8#L733-5true, 44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,175 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,175 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,175 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,175 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:40,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,316 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,317 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,317 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,317 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,324 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,324 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,324 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,324 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [8#L733-5true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,374 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,374 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,374 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,374 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [8#L733-5true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,375 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,375 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,375 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,375 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,388 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,389 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,389 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,389 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,389 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,389 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,389 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,390 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,390 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:40,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [104#L724true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,495 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,495 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,495 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,495 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,495 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [75#L725true, 8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,574 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,574 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,574 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,574 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [75#L725true, 8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,574 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,574 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,574 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,575 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:40,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,658 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,658 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,658 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,658 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,658 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,659 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,659 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,659 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,677 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,677 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,677 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,677 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,678 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,678 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,678 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,678 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:40,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,901 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,901 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,901 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,902 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:40,910 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,910 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,910 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:40,911 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:41,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,002 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,002 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,002 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,002 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,002 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,003 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,003 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,003 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,015 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [145#(= ~COND~0 0), 104#L724true, 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,015 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,015 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,016 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,016 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,016 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,016 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,016 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,016 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,017 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,017 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,017 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:41,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [75#L725true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,133 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,133 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,133 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,133 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [75#L725true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,133 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,133 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,134 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,134 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:41,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,207 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,207 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,207 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,207 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-19 08:02:41,208 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,208 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,208 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,208 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:41,276 INFO L124 PetriNetUnfolderBase]: 13844/21481 cut-off events. [2023-11-19 08:02:41,277 INFO L125 PetriNetUnfolderBase]: For 13605/15222 co-relation queries the response was YES. [2023-11-19 08:02:41,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50616 conditions, 21481 events. 13844/21481 cut-off events. For 13605/15222 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 168587 event pairs, 5116 based on Foata normal form. 1145/21859 useless extension candidates. Maximal degree in co-relation 50604. Up to 9908 conditions per place. [2023-11-19 08:02:41,510 INFO L140 encePairwiseOnDemand]: 201/211 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-11-19 08:02:41,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 627 flow [2023-11-19 08:02:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-19 08:02:41,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676145339652449 [2023-11-19 08:02:41,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-19 08:02:41,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-19 08:02:41,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:41,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-19 08:02:41,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 08:02:41,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 08:02:41,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 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 08:02:41,517 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 326 flow. Second operand 3 states and 296 transitions. [2023-11-19 08:02:41,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 627 flow [2023-11-19 08:02:41,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:41,565 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 384 flow [2023-11-19 08:02:41,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=70, PETRI_TRANSITIONS=83} [2023-11-19 08:02:41,567 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-19 08:02:41,567 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 384 flow [2023-11-19 08:02:41,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 08:02:41,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:41,568 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 08:02:41,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:02:41,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-19 08:02:41,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1051817941, now seen corresponding path program 1 times [2023-11-19 08:02:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425988357] [2023-11-19 08:02:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:41,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:41,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:02:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:41,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:02:41,605 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:02:41,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-11-19 08:02:41,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2023-11-19 08:02:41,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2023-11-19 08:02:41,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2023-11-19 08:02:41,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2023-11-19 08:02:41,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2023-11-19 08:02:41,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2023-11-19 08:02:41,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2023-11-19 08:02:41,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:02:41,607 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-19 08:02:41,608 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:02:41,608 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-19 08:02:41,648 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:41,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions, 316 flow [2023-11-19 08:02:41,691 INFO L124 PetriNetUnfolderBase]: 17/214 cut-off events. [2023-11-19 08:02:41,691 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 08:02:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 214 events. 17/214 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 687 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 176. Up to 10 conditions per place. [2023-11-19 08:02:41,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 144 transitions, 316 flow [2023-11-19 08:02:41,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 144 transitions, 316 flow [2023-11-19 08:02:41,696 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:41,696 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 144 transitions, 316 flow [2023-11-19 08:02:41,696 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 144 transitions, 316 flow [2023-11-19 08:02:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions, 316 flow [2023-11-19 08:02:41,813 INFO L124 PetriNetUnfolderBase]: 17/214 cut-off events. [2023-11-19 08:02:41,813 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 08:02:41,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 214 events. 17/214 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 687 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 176. Up to 10 conditions per place. [2023-11-19 08:02:41,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 13176 [2023-11-19 08:02:43,102 INFO L134 LiptonReduction]: Checked pairs total: 48221 [2023-11-19 08:02:43,102 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-19 08:02:43,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:43,105 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;@1c92f727, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:43,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-19 08:02:43,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:43,106 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:02:43,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:43,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:43,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:43,106 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 08:02:43,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash 34812, now seen corresponding path program 1 times [2023-11-19 08:02:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:43,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121328297] [2023-11-19 08:02:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:43,115 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 08:02:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:43,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121328297] [2023-11-19 08:02:43,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121328297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:43,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:43,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182925774] [2023-11-19 08:02:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:43,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:43,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 257 [2023-11-19 08:02:43,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 166 flow. Second operand has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 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 08:02:43,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:43,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 257 [2023-11-19 08:02:43,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:54,418 INFO L124 PetriNetUnfolderBase]: 78973/112782 cut-off events. [2023-11-19 08:02:54,418 INFO L125 PetriNetUnfolderBase]: For 7449/7449 co-relation queries the response was YES. [2023-11-19 08:02:54,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216434 conditions, 112782 events. 78973/112782 cut-off events. For 7449/7449 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 914592 event pairs, 68637 based on Foata normal form. 0/94939 useless extension candidates. Maximal degree in co-relation 19526. Up to 100698 conditions per place. [2023-11-19 08:02:55,310 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 38 selfloop transitions, 0 changer transitions 0/63 dead transitions. [2023-11-19 08:02:55,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 230 flow [2023-11-19 08:02:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2023-11-19 08:02:55,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48249027237354086 [2023-11-19 08:02:55,312 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 248 transitions. [2023-11-19 08:02:55,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 248 transitions. [2023-11-19 08:02:55,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:55,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 248 transitions. [2023-11-19 08:02:55,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 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 08:02:55,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:55,316 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:55,316 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 166 flow. Second operand 2 states and 248 transitions. [2023-11-19 08:02:55,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 230 flow [2023-11-19 08:02:55,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 224 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:55,323 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 148 flow [2023-11-19 08:02:55,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=69, PETRI_TRANSITIONS=63} [2023-11-19 08:02:55,324 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-19 08:02:55,325 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 148 flow [2023-11-19 08:02:55,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 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 08:02:55,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:55,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:55,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 08:02:55,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-19 08:02:55,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash 34825, now seen corresponding path program 1 times [2023-11-19 08:02:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881915443] [2023-11-19 08:02:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:55,358 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 08:02:55,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:55,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881915443] [2023-11-19 08:02:55,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881915443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:55,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:55,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:55,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499787200] [2023-11-19 08:02:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:55,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:55,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:55,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:55,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 257 [2023-11-19 08:02:55,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 148 flow. Second operand has 3 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 08:02:55,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:55,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 257 [2023-11-19 08:02:55,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:02,628 INFO L124 PetriNetUnfolderBase]: 58024/83640 cut-off events. [2023-11-19 08:03:02,628 INFO L125 PetriNetUnfolderBase]: For 3616/3616 co-relation queries the response was YES. [2023-11-19 08:03:02,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159784 conditions, 83640 events. 58024/83640 cut-off events. For 3616/3616 co-relation queries the response was YES. Maximal size of possible extension queue 3530. Compared 666467 event pairs, 50272 based on Foata normal form. 0/72786 useless extension candidates. Maximal degree in co-relation 159777. Up to 74317 conditions per place. [2023-11-19 08:03:03,242 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 36 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-11-19 08:03:03,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 220 flow [2023-11-19 08:03:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-19 08:03:03,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267185473411154 [2023-11-19 08:03:03,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-19 08:03:03,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-19 08:03:03,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:03,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-19 08:03:03,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 08:03:03,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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 08:03:03,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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 08:03:03,251 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 148 flow. Second operand 3 states and 329 transitions. [2023-11-19 08:03:03,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 220 flow [2023-11-19 08:03:03,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:03,259 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 148 flow [2023-11-19 08:03:03,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=70, PETRI_TRANSITIONS=62} [2023-11-19 08:03:03,260 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-19 08:03:03,260 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 148 flow [2023-11-19 08:03:03,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 08:03:03,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:03,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:03:03,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 08:03:03,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-19 08:03:03,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 34824, now seen corresponding path program 1 times [2023-11-19 08:03:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612369439] [2023-11-19 08:03:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:03,288 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 08:03:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612369439] [2023-11-19 08:03:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612369439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:03,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:03,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:03:03,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904275662] [2023-11-19 08:03:03,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:03,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:03,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 257 [2023-11-19 08:03:03,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 08:03:03,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:03,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 257 [2023-11-19 08:03:03,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:08,160 INFO L124 PetriNetUnfolderBase]: 37075/54498 cut-off events. [2023-11-19 08:03:08,161 INFO L125 PetriNetUnfolderBase]: For 3616/3616 co-relation queries the response was YES. [2023-11-19 08:03:08,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104264 conditions, 54498 events. 37075/54498 cut-off events. For 3616/3616 co-relation queries the response was YES. Maximal size of possible extension queue 2332. Compared 425884 event pairs, 31907 based on Foata normal form. 0/50633 useless extension candidates. Maximal degree in co-relation 104256. Up to 47937 conditions per place. [2023-11-19 08:03:08,551 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 35 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2023-11-19 08:03:08,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 61 transitions, 218 flow [2023-11-19 08:03:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-19 08:03:08,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176394293125811 [2023-11-19 08:03:08,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-19 08:03:08,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-19 08:03:08,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:08,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-19 08:03:08,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 08:03:08,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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 08:03:08,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 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 08:03:08,558 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 148 flow. Second operand 3 states and 322 transitions. [2023-11-19 08:03:08,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 61 transitions, 218 flow [2023-11-19 08:03:08,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:03:08,568 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 147 flow [2023-11-19 08:03:08,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=70, PETRI_TRANSITIONS=61} [2023-11-19 08:03:08,569 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-19 08:03:08,570 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 147 flow [2023-11-19 08:03:08,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 08:03:08,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:08,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 08:03:08,571 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 08:03:08,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash 142165112, now seen corresponding path program 1 times [2023-11-19 08:03:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:08,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46200370] [2023-11-19 08:03:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:08,674 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 08:03:08,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:08,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46200370] [2023-11-19 08:03:08,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46200370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:08,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023457441] [2023-11-19 08:03:08,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:08,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:03:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:03:08,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:03:08,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 257 [2023-11-19 08:03:08,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 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 08:03:08,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:08,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 257 [2023-11-19 08:03:08,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand