./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI --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 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:41:26,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:41:26,219 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:41:26,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:41:26,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:41:26,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:41:26,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:41:26,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:41:26,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:41:26,291 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:41:26,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:41:26,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:41:26,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:41:26,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:41:26,296 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:41:26,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:41:26,297 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:41:26,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:41:26,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:41:26,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:41:26,299 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:41:26,300 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:41:26,300 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:41:26,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:41:26,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:41:26,302 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:41:26,302 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:41:26,303 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:41:26,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:41:26,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:41:26,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:41:26,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:41:26,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:26,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:41:26,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:41:26,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:41:26,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:41:26,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:41:26,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:41:26,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:41:26,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:41:26,324 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_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/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_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI 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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2023-11-24 21:41:26,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:41:26,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:41:26,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:41:26,701 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:41:26,701 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:41:26,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2023-11-24 21:41:29,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:41:29,998 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:41:29,999 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2023-11-24 21:41:30,041 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/data/f4f9ba165/449d3b3937f2483ab201a6bb4698c73b/FLAG134860a28 [2023-11-24 21:41:30,055 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/data/f4f9ba165/449d3b3937f2483ab201a6bb4698c73b [2023-11-24 21:41:30,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:41:30,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:41:30,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:30,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:41:30,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:41:30,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:30,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5a5d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30, skipping insertion in model container [2023-11-24 21:41:30,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:30,142 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:41:30,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:30,687 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:41:30,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:30,853 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:30,853 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:30,862 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:41:30,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30 WrapperNode [2023-11-24 21:41:30,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:30,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:30,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:41:30,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:41:30,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:30,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:30,973 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 167 [2023-11-24 21:41:30,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:30,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:41:30,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:41:30,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:41:30,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:30,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,039 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-24 21:41:31,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:41:31,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:41:31,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:41:31,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:41:31,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (1/1) ... [2023-11-24 21:41:31,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:31,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:31,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:41:31,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1cdc5df-90a8-4869-a342-9da86b4cafe5/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:41:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:41:31,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:41:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:41:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:41:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:41:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:41:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:41:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:41:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:41:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:41:31,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:41:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:41:31,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:41:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:41:31,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:41:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-24 21:41:31,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-24 21:41:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:41:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:41:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:41:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:41:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:41:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:41:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:41:31,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:41:31,202 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:41:31,385 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:41:31,388 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:41:31,960 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:41:32,181 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:41:32,182 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:41:32,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:32 BoogieIcfgContainer [2023-11-24 21:41:32,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:41:32,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:41:32,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:41:32,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:41:32,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:41:30" (1/3) ... [2023-11-24 21:41:32,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785f0a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:32, skipping insertion in model container [2023-11-24 21:41:32,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:30" (2/3) ... [2023-11-24 21:41:32,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785f0a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:32, skipping insertion in model container [2023-11-24 21:41:32,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:32" (3/3) ... [2023-11-24 21:41:32,191 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2023-11-24 21:41:32,208 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:41:32,208 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 21:41:32,209 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:41:32,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:41:32,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-24 21:41:32,352 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-24 21:41:32,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:32,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-24 21:41:32,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-24 21:41:32,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-24 21:41:32,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:41:32,380 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;@53d4dfd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:41:32,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-24 21:41:32,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:41:32,384 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:41:32,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:32,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:32,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:32,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:32,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 14296, now seen corresponding path program 1 times [2023-11-24 21:41:32,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:32,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566378866] [2023-11-24 21:41:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:32,727 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-24 21:41:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:32,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566378866] [2023-11-24 21:41:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566378866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:32,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212088868] [2023-11-24 21:41:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:32,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:32,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:32,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:32,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:41:32,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-24 21:41:32,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:32,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:41:32,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:34,523 INFO L124 PetriNetUnfolderBase]: 3508/6059 cut-off events. [2023-11-24 21:41:34,524 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-24 21:41:34,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11044 conditions, 6059 events. 3508/6059 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 45304 event pairs, 2752 based on Foata normal form. 270/5717 useless extension candidates. Maximal degree in co-relation 11029. Up to 3825 conditions per place. [2023-11-24 21:41:34,601 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-24 21:41:34,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 224 flow [2023-11-24 21:41:34,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-24 21:41:34,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-24 21:41:34,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-24 21:41:34,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-24 21:41:34,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:34,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-24 21:41:34,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-24 21:41:34,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:34,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:34,639 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 148 transitions. [2023-11-24 21:41:34,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 224 flow [2023-11-24 21:41:34,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:41:34,656 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-24 21:41:34,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-24 21:41:34,664 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-24 21:41:34,664 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-24 21:41:34,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-24 21:41:34,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:34,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:34,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:41:34,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:34,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash 14297, now seen corresponding path program 1 times [2023-11-24 21:41:34,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:34,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360101373] [2023-11-24 21:41:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:34,833 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-24 21:41:34,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360101373] [2023-11-24 21:41:34,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360101373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:34,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:34,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628872118] [2023-11-24 21:41:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:34,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:34,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:34,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:41:34,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-24 21:41:34,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:34,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:41:34,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:36,153 INFO L124 PetriNetUnfolderBase]: 3508/6058 cut-off events. [2023-11-24 21:41:36,153 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-24 21:41:36,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11175 conditions, 6058 events. 3508/6058 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 45147 event pairs, 2752 based on Foata normal form. 1/5447 useless extension candidates. Maximal degree in co-relation 11164. Up to 3824 conditions per place. [2023-11-24 21:41:36,270 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-24 21:41:36,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 220 flow [2023-11-24 21:41:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-24 21:41:36,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-24 21:41:36,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-24 21:41:36,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-24 21:41:36,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:36,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-24 21:41:36,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-24 21:41:36,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:36,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:36,288 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 148 transitions. [2023-11-24 21:41:36,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 220 flow [2023-11-24 21:41:36,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:36,305 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-24 21:41:36,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-24 21:41:36,311 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-24 21:41:36,312 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-24 21:41:36,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-24 21:41:36,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:36,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:36,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:41:36,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:36,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 426336034, now seen corresponding path program 1 times [2023-11-24 21:41:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374349434] [2023-11-24 21:41:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374349434] [2023-11-24 21:41:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374349434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802486142] [2023-11-24 21:41:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:36,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:36,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:36,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:36,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:41:36,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-24 21:41:36,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:36,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:41:36,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:37,674 INFO L124 PetriNetUnfolderBase]: 3510/6011 cut-off events. [2023-11-24 21:41:37,675 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-24 21:41:37,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11133 conditions, 6011 events. 3510/6011 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 44629 event pairs, 2797 based on Foata normal form. 0/5405 useless extension candidates. Maximal degree in co-relation 11122. Up to 3825 conditions per place. [2023-11-24 21:41:37,736 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-24 21:41:37,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 220 flow [2023-11-24 21:41:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:41:37,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-24 21:41:37,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:41:37,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:41:37,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:37,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:41:37,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 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-24 21:41:37,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:37,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:37,742 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:41:37,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 220 flow [2023-11-24 21:41:37,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:37,756 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-24 21:41:37,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-24 21:41:37,757 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-24 21:41:37,757 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-24 21:41:37,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-24 21:41:37,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:37,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:37,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:41:37,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:37,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash 426336035, now seen corresponding path program 1 times [2023-11-24 21:41:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:37,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423244998] [2023-11-24 21:41:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:37,830 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-24 21:41:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423244998] [2023-11-24 21:41:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423244998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:37,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:37,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:37,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465932574] [2023-11-24 21:41:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:37,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:37,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:37,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:41:37,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-24 21:41:37,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:37,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:41:37,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:38,841 INFO L124 PetriNetUnfolderBase]: 3508/6052 cut-off events. [2023-11-24 21:41:38,841 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-24 21:41:38,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11171 conditions, 6052 events. 3508/6052 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 45340 event pairs, 2220 based on Foata normal form. 3/5452 useless extension candidates. Maximal degree in co-relation 11161. Up to 3820 conditions per place. [2023-11-24 21:41:38,901 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-24 21:41:38,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 216 flow [2023-11-24 21:41:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-24 21:41:38,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-24 21:41:38,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-24 21:41:38,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-24 21:41:38,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:38,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-24 21:41:38,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-24 21:41:38,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:38,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:38,907 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 148 transitions. [2023-11-24 21:41:38,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 216 flow [2023-11-24 21:41:38,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:38,914 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-24 21:41:38,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-24 21:41:38,916 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-24 21:41:38,916 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-24 21:41:38,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-24 21:41:38,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:38,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:38,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:41:38,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:38,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash 758935739, now seen corresponding path program 1 times [2023-11-24 21:41:38,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:38,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131273847] [2023-11-24 21:41:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:39,091 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-24 21:41:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131273847] [2023-11-24 21:41:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131273847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:39,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590477653] [2023-11-24 21:41:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:39,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:39,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:39,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:39,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-24 21:41:39,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-24 21:41:39,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:39,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-24 21:41:39,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:39,983 INFO L124 PetriNetUnfolderBase]: 2754/4611 cut-off events. [2023-11-24 21:41:39,984 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-24 21:41:39,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8658 conditions, 4611 events. 2754/4611 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32976 event pairs, 492 based on Foata normal form. 0/4504 useless extension candidates. Maximal degree in co-relation 8648. Up to 3064 conditions per place. [2023-11-24 21:41:40,024 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 39 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2023-11-24 21:41:40,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 250 flow [2023-11-24 21:41:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2023-11-24 21:41:40,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7860696517412935 [2023-11-24 21:41:40,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions. [2023-11-24 21:41:40,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions. [2023-11-24 21:41:40,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:40,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions. [2023-11-24 21:41:40,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 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-24 21:41:40,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:40,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:40,030 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 158 transitions. [2023-11-24 21:41:40,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 250 flow [2023-11-24 21:41:40,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:40,034 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-24 21:41:40,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-24 21:41:40,038 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-24 21:41:40,038 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-24 21:41:40,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-24 21:41:40,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:40,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:40,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:41:40,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:40,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 758934109, now seen corresponding path program 1 times [2023-11-24 21:41:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330843787] [2023-11-24 21:41:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:40,129 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-24 21:41:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330843787] [2023-11-24 21:41:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330843787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102024320] [2023-11-24 21:41:40,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:40,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:40,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:40,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:40,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:41:40,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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-24 21:41:40,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:40,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:41:40,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:41,042 INFO L124 PetriNetUnfolderBase]: 2457/4377 cut-off events. [2023-11-24 21:41:41,042 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-24 21:41:41,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8149 conditions, 4377 events. 2457/4377 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 31992 event pairs, 1123 based on Foata normal form. 12/4134 useless extension candidates. Maximal degree in co-relation 8138. Up to 2990 conditions per place. [2023-11-24 21:41:41,099 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 21:41:41,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 204 flow [2023-11-24 21:41:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-24 21:41:41,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-24 21:41:41,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-24 21:41:41,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-24 21:41:41,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:41,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-24 21:41:41,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-24 21:41:41,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:41,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:41,105 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 145 transitions. [2023-11-24 21:41:41,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 204 flow [2023-11-24 21:41:41,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:41,108 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-24 21:41:41,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-24 21:41:41,109 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-24 21:41:41,110 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-24 21:41:41,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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-24 21:41:41,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:41,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:41,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:41:41,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:41,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 758934108, now seen corresponding path program 1 times [2023-11-24 21:41:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027075836] [2023-11-24 21:41:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:41,166 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-24 21:41:41,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027075836] [2023-11-24 21:41:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027075836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:41,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317550889] [2023-11-24 21:41:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:41,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:41,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:41,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:41,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:41:41,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-24 21:41:41,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:41,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:41:41,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:41,927 INFO L124 PetriNetUnfolderBase]: 2474/4346 cut-off events. [2023-11-24 21:41:41,927 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-24 21:41:41,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8026 conditions, 4346 events. 2474/4346 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 31568 event pairs, 1489 based on Foata normal form. 0/4100 useless extension candidates. Maximal degree in co-relation 8016. Up to 3019 conditions per place. [2023-11-24 21:41:41,975 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 21:41:41,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 202 flow [2023-11-24 21:41:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 21:41:41,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-24 21:41:41,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 21:41:41,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 21:41:41,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:41,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 21:41:41,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-24 21:41:41,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:41,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:41,983 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 143 transitions. [2023-11-24 21:41:41,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 202 flow [2023-11-24 21:41:41,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:41,989 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-24 21:41:41,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-24 21:41:41,991 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-24 21:41:41,991 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-24 21:41:41,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-24 21:41:41,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:41,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:41:41,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:41,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 698603078, now seen corresponding path program 1 times [2023-11-24 21:41:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:41,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972645901] [2023-11-24 21:41:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:42,069 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-24 21:41:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:42,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972645901] [2023-11-24 21:41:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972645901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944150161] [2023-11-24 21:41:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:42,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:42,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:42,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:42,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:41:42,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-24 21:41:42,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:42,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:41:42,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:42,828 INFO L124 PetriNetUnfolderBase]: 2532/4356 cut-off events. [2023-11-24 21:41:42,828 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-24 21:41:42,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8118 conditions, 4356 events. 2532/4356 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 30760 event pairs, 1191 based on Foata normal form. 0/4179 useless extension candidates. Maximal degree in co-relation 8108. Up to 2985 conditions per place. [2023-11-24 21:41:42,869 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:41:42,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 200 flow [2023-11-24 21:41:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 21:41:42,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-24 21:41:42,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 21:41:42,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 21:41:42,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:42,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 21:41:42,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-24 21:41:42,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:42,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:42,874 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-24 21:41:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 200 flow [2023-11-24 21:41:42,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:42,877 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-24 21:41:42,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-24 21:41:42,878 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-24 21:41:42,878 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-24 21:41:42,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-24 21:41:42,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:42,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:41:42,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:42,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash 698603079, now seen corresponding path program 1 times [2023-11-24 21:41:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247964470] [2023-11-24 21:41:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:42,957 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-24 21:41:42,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:42,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247964470] [2023-11-24 21:41:42,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247964470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:42,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:42,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889162439] [2023-11-24 21:41:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:42,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:42,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:42,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:42,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:41:42,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-24 21:41:42,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:42,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:41:42,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:43,498 INFO L124 PetriNetUnfolderBase]: 2457/4293 cut-off events. [2023-11-24 21:41:43,499 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-24 21:41:43,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7968 conditions, 4293 events. 2457/4293 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 30708 event pairs, 735 based on Foata normal form. 36/4176 useless extension candidates. Maximal degree in co-relation 7958. Up to 2874 conditions per place. [2023-11-24 21:41:43,539 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-24 21:41:43,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 196 flow [2023-11-24 21:41:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-24 21:41:43,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-24 21:41:43,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-24 21:41:43,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-24 21:41:43,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:43,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-24 21:41:43,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-24 21:41:43,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:43,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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-24 21:41:43,544 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 145 transitions. [2023-11-24 21:41:43,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 196 flow [2023-11-24 21:41:43,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:43,547 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-24 21:41:43,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-24 21:41:43,548 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-24 21:41:43,548 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-24 21:41:43,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-24 21:41:43,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:43,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:43,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:41:43,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:43,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 213441429, now seen corresponding path program 1 times [2023-11-24 21:41:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32234561] [2023-11-24 21:41:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:44,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:44,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32234561] [2023-11-24 21:41:44,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32234561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:44,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:44,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:41:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926931978] [2023-11-24 21:41:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:44,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:41:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:41:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:41:44,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-24 21:41:44,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-24 21:41:44,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:44,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-24 21:41:44,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:46,066 INFO L124 PetriNetUnfolderBase]: 3326/5399 cut-off events. [2023-11-24 21:41:46,066 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-11-24 21:41:46,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10280 conditions, 5399 events. 3326/5399 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 35970 event pairs, 192 based on Foata normal form. 144/5506 useless extension candidates. Maximal degree in co-relation 10269. Up to 2979 conditions per place. [2023-11-24 21:41:46,102 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 48 selfloop transitions, 5 changer transitions 12/87 dead transitions. [2023-11-24 21:41:46,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 318 flow [2023-11-24 21:41:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:41:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:41:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2023-11-24 21:41:46,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6305970149253731 [2023-11-24 21:41:46,106 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 338 transitions. [2023-11-24 21:41:46,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 338 transitions. [2023-11-24 21:41:46,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:46,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 338 transitions. [2023-11-24 21:41:46,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:46,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 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-24 21:41:46,110 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 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-24 21:41:46,110 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 338 transitions. [2023-11-24 21:41:46,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 318 flow [2023-11-24 21:41:46,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:46,113 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-24 21:41:46,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-24 21:41:46,114 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-24 21:41:46,114 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-24 21:41:46,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-24 21:41:46,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:46,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:46,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:41:46,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:46,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash 213442715, now seen corresponding path program 1 times [2023-11-24 21:41:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302049983] [2023-11-24 21:41:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:46,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:46,690 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-24 21:41:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:46,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302049983] [2023-11-24 21:41:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302049983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:46,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:46,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688683143] [2023-11-24 21:41:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:46,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:41:46,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:46,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:41:46,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:41:46,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-24 21:41:46,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 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-24 21:41:46,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:46,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-24 21:41:46,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:49,712 INFO L124 PetriNetUnfolderBase]: 14419/20930 cut-off events. [2023-11-24 21:41:49,712 INFO L125 PetriNetUnfolderBase]: For 907/907 co-relation queries the response was YES. [2023-11-24 21:41:49,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41465 conditions, 20930 events. 14419/20930 cut-off events. For 907/907 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 143808 event pairs, 1621 based on Foata normal form. 0/20429 useless extension candidates. Maximal degree in co-relation 41454. Up to 10841 conditions per place. [2023-11-24 21:41:50,004 INFO L140 encePairwiseOnDemand]: 51/67 looper letters, 46 selfloop transitions, 14 changer transitions 103/182 dead transitions. [2023-11-24 21:41:50,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 182 transitions, 730 flow [2023-11-24 21:41:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:41:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-24 21:41:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 550 transitions. [2023-11-24 21:41:50,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6840796019900498 [2023-11-24 21:41:50,009 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 550 transitions. [2023-11-24 21:41:50,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 550 transitions. [2023-11-24 21:41:50,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:50,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 550 transitions. [2023-11-24 21:41:50,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 45.833333333333336) internal successors, (550), 12 states have internal predecessors, (550), 0 states have call successors, (0), 0 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-24 21:41:50,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 67.0) internal successors, (871), 13 states have internal predecessors, (871), 0 states have call successors, (0), 0 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-24 21:41:50,017 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 67.0) internal successors, (871), 13 states have internal predecessors, (871), 0 states have call successors, (0), 0 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-24 21:41:50,017 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 12 states and 550 transitions. [2023-11-24 21:41:50,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 182 transitions, 730 flow [2023-11-24 21:41:50,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 182 transitions, 710 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-24 21:41:50,033 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 255 flow [2023-11-24 21:41:50,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=255, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2023-11-24 21:41:50,034 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-24 21:41:50,034 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 255 flow [2023-11-24 21:41:50,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 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-24 21:41:50,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:50,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:50,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:41:50,035 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:50,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash 347486266, now seen corresponding path program 1 times [2023-11-24 21:41:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935679235] [2023-11-24 21:41:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,339 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-24 21:41:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935679235] [2023-11-24 21:41:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935679235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039834841] [2023-11-24 21:41:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:50,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:50,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:41:50,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-24 21:41:50,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:50,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:41:50,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:52,467 INFO L124 PetriNetUnfolderBase]: 8625/13124 cut-off events. [2023-11-24 21:41:52,467 INFO L125 PetriNetUnfolderBase]: For 28909/29815 co-relation queries the response was YES. [2023-11-24 21:41:52,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52006 conditions, 13124 events. 8625/13124 cut-off events. For 28909/29815 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 91741 event pairs, 1972 based on Foata normal form. 390/12729 useless extension candidates. Maximal degree in co-relation 51986. Up to 7533 conditions per place. [2023-11-24 21:41:52,592 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 55 selfloop transitions, 5 changer transitions 43/131 dead transitions. [2023-11-24 21:41:52,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 131 transitions, 894 flow [2023-11-24 21:41:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:41:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:41:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 325 transitions. [2023-11-24 21:41:52,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6929637526652452 [2023-11-24 21:41:52,595 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 325 transitions. [2023-11-24 21:41:52,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 325 transitions. [2023-11-24 21:41:52,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:52,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 325 transitions. [2023-11-24 21:41:52,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 0 states have call successors, (0), 0 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-24 21:41:52,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 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-24 21:41:52,600 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 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-24 21:41:52,600 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 255 flow. Second operand 7 states and 325 transitions. [2023-11-24 21:41:52,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 131 transitions, 894 flow [2023-11-24 21:41:53,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 814 flow, removed 40 selfloop flow, removed 5 redundant places. [2023-11-24 21:41:53,374 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 268 flow [2023-11-24 21:41:53,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-11-24 21:41:53,375 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 1 predicate places. [2023-11-24 21:41:53,376 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 268 flow [2023-11-24 21:41:53,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-24 21:41:53,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:53,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:53,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:41:53,377 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:53,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2146585561, now seen corresponding path program 1 times [2023-11-24 21:41:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848862594] [2023-11-24 21:41:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,956 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-24 21:41:53,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:53,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848862594] [2023-11-24 21:41:53,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848862594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:53,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:53,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:53,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541158034] [2023-11-24 21:41:53,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:53,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:53,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:53,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:53,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:41:53,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-24 21:41:53,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:53,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:41:53,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:55,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L756-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_43 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_42 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_43)) (= (ite .cse2 0 v_~x$w_buff0_used~0_52) v_~x$w_buff0_used~0_51) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= (ite .cse2 v_~x$w_buff0~0_12 (ite .cse0 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][12], [130#true, 30#L868true, P0Thread1of1ForFork3InUse, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 160#(= ~__unbuffered_p3_EAX~0 0), Black: 166#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, Black: 168#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 125#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork0InUse, 158#true, 57#L832true, 65#P2EXITtrue, 15#$Ultimate##0true, Black: 139#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 132#(<= ~z~0 0), Black: 143#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 175#true, 46#L763true, Black: 133#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))))]) [2023-11-24 21:41:55,268 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,268 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,268 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,268 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L832-->L839: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd4~0_30 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_32 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff0_thd4~0_31 (ite .cse0 0 v_~x$r_buff0_thd4~0_32)) (= v_~x~0_35 (ite .cse2 v_~x$w_buff0~0_28 (ite .cse1 v_~x$w_buff1~0_23 v_~x~0_36))) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_31 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd4~0_30) v_~x$r_buff1_thd4~0_29) (= v_~x$w_buff0_used~0_103 (ite .cse2 0 v_~x$w_buff0_used~0_104))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_32, ~x~0=v_~x~0_36, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_30, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_31, ~x~0=v_~x~0_35, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_29, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][66], [60#L839true, 130#true, 30#L868true, P0Thread1of1ForFork3InUse, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 43#L756true, P3Thread1of1ForFork2InUse, Black: 160#(= ~__unbuffered_p3_EAX~0 0), Black: 166#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, Black: 168#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 125#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork0InUse, 158#true, 65#P2EXITtrue, 15#$Ultimate##0true, Black: 139#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 132#(<= ~z~0 0), Black: 143#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 175#true, Black: 133#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))))]) [2023-11-24 21:41:55,269 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,269 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,269 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,270 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:41:55,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L771-->L783: Formula: (and (= v_~x$w_buff0~0_87 v_~x$w_buff1~0_73) (= v_~x$r_buff1_thd2~0_41 v_~x$r_buff0_thd2~0_67) (= |v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_4| |v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_3|) (= v_~x$r_buff1_thd1~0_47 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd0~0_83 v_~x$r_buff0_thd0~0_79) (= v_~x$w_buff0_used~0_173 1) (= v_~x$r_buff1_thd3~0_45 v_~x$r_buff0_thd3~0_57) (= |v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_4| |v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_3|) (not (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_173 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_152 256))))) 1 0) 0)) (= v_~x$r_buff1_thd4~0_57 v_~x$r_buff0_thd4~0_55) (= 2 v_~x$w_buff0~0_86) (= v_~x$w_buff0_used~0_174 v_~x$w_buff1_used~0_152) (= v_~x$r_buff0_thd2~0_66 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_87, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_3|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_55, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_67, P1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$w_buff1~0=v_~x$w_buff1~0_73, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_45, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_152, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_55, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_66, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_83, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_57, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, P1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_4|, P1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_P1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_4|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, P1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset][22], [130#true, 30#L868true, P0Thread1of1ForFork3InUse, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 56#L783true, Black: 164#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, 43#L756true, Black: 160#(= ~__unbuffered_p3_EAX~0 0), Black: 166#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, Black: 168#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 125#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork0InUse, 158#true, 65#P2EXITtrue, 57#L832true, Black: 139#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 132#(<= ~z~0 0), Black: 143#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 175#true, Black: 133#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))))]) [2023-11-24 21:41:55,424 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:41:55,425 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:41:55,425 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:41:55,425 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:41:55,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([413] L868-->L874: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd0~0_50 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_52 256) 0)))) (let ((.cse2 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse4 (and .cse0 .cse5)) (.cse3 (and (not (= 0 (mod v_~x$w_buff1_used~0_119 256))) .cse1))) (and (= v_~x$r_buff1_thd0~0_49 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_118 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_50)) (= v_~x~0_73 (ite .cse2 v_~x$w_buff0~0_46 (ite .cse3 v_~x$w_buff1~0_35 v_~x~0_74))) (= (ite .cse2 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= v_~x$r_buff0_thd0~0_51 (ite .cse4 0 v_~x$r_buff0_thd0~0_52)) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_119) v_~x$w_buff1_used~0_118)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_119, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_50, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_118, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_49, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0][61], [130#true, P0Thread1of1ForFork3InUse, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, 43#L756true, Black: 160#(= ~__unbuffered_p3_EAX~0 0), Black: 166#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork1InUse, Black: 168#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 125#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork0InUse, 158#true, 65#P2EXITtrue, 57#L832true, 15#$Ultimate##0true, Black: 139#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 132#(<= ~z~0 0), 12#L874true, 175#true, Black: 143#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0))))]) [2023-11-24 21:41:55,449 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-11-24 21:41:55,449 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-24 21:41:55,449 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-24 21:41:55,449 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-24 21:41:56,531 INFO L124 PetriNetUnfolderBase]: 11427/17274 cut-off events. [2023-11-24 21:41:56,531 INFO L125 PetriNetUnfolderBase]: For 24590/25792 co-relation queries the response was YES. [2023-11-24 21:41:56,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61912 conditions, 17274 events. 11427/17274 cut-off events. For 24590/25792 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 123184 event pairs, 3573 based on Foata normal form. 405/16592 useless extension candidates. Maximal degree in co-relation 61890. Up to 10449 conditions per place. [2023-11-24 21:41:56,722 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 63 selfloop transitions, 11 changer transitions 31/134 dead transitions. [2023-11-24 21:41:56,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 134 transitions, 844 flow [2023-11-24 21:41:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:41:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:41:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2023-11-24 21:41:56,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6993603411513859 [2023-11-24 21:41:56,726 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 328 transitions. [2023-11-24 21:41:56,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 328 transitions. [2023-11-24 21:41:56,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:56,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 328 transitions. [2023-11-24 21:41:56,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.857142857142854) internal successors, (328), 7 states have internal predecessors, (328), 0 states have call successors, (0), 0 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-24 21:41:56,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 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-24 21:41:56,735 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 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-24 21:41:56,735 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 268 flow. Second operand 7 states and 328 transitions. [2023-11-24 21:41:56,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 134 transitions, 844 flow [2023-11-24 21:41:57,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 134 transitions, 829 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-24 21:41:57,630 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 392 flow [2023-11-24 21:41:57,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2023-11-24 21:41:57,631 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-11-24 21:41:57,632 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 392 flow [2023-11-24 21:41:57,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-24 21:41:57,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:57,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:57,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:41:57,633 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:41:57,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1606870769, now seen corresponding path program 1 times [2023-11-24 21:41:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:57,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378332190] [2023-11-24 21:41:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:58,622 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-24 21:41:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:58,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378332190] [2023-11-24 21:41:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378332190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:58,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:41:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559473604] [2023-11-24 21:41:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:58,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:58,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:58,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:41:58,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 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-24 21:41:58,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:58,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:41:58,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:01,697 INFO L124 PetriNetUnfolderBase]: 11880/18173 cut-off events. [2023-11-24 21:42:01,698 INFO L125 PetriNetUnfolderBase]: For 42587/44061 co-relation queries the response was YES. [2023-11-24 21:42:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70462 conditions, 18173 events. 11880/18173 cut-off events. For 42587/44061 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 132978 event pairs, 3540 based on Foata normal form. 438/17593 useless extension candidates. Maximal degree in co-relation 70436. Up to 10431 conditions per place. [2023-11-24 21:42:01,888 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 75 selfloop transitions, 28 changer transitions 33/165 dead transitions. [2023-11-24 21:42:01,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 165 transitions, 1191 flow [2023-11-24 21:42:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:42:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:42:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 459 transitions. [2023-11-24 21:42:01,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2023-11-24 21:42:01,892 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 459 transitions. [2023-11-24 21:42:01,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 459 transitions. [2023-11-24 21:42:01,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:01,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 459 transitions. [2023-11-24 21:42:01,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.9) internal successors, (459), 10 states have internal predecessors, (459), 0 states have call successors, (0), 0 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-24 21:42:01,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-24 21:42:01,897 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-24 21:42:01,898 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 392 flow. Second operand 10 states and 459 transitions. [2023-11-24 21:42:01,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 165 transitions, 1191 flow [2023-11-24 21:42:02,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 165 transitions, 1175 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-24 21:42:02,031 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 666 flow [2023-11-24 21:42:02,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=666, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2023-11-24 21:42:02,032 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 19 predicate places. [2023-11-24 21:42:02,032 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 666 flow [2023-11-24 21:42:02,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 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-24 21:42:02,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:02,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:02,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:42:02,033 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:42:02,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash 777702631, now seen corresponding path program 1 times [2023-11-24 21:42:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271277948] [2023-11-24 21:42:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:02,755 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-24 21:42:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271277948] [2023-11-24 21:42:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271277948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:02,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:42:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208286128] [2023-11-24 21:42:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:02,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:42:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:42:02,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:42:02,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 67 [2023-11-24 21:42:02,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 666 flow. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-24 21:42:02,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:02,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 67 [2023-11-24 21:42:02,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:07,035 INFO L124 PetriNetUnfolderBase]: 15843/23334 cut-off events. [2023-11-24 21:42:07,035 INFO L125 PetriNetUnfolderBase]: For 100216/100296 co-relation queries the response was YES. [2023-11-24 21:42:07,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108006 conditions, 23334 events. 15843/23334 cut-off events. For 100216/100296 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 159928 event pairs, 4293 based on Foata normal form. 322/23619 useless extension candidates. Maximal degree in co-relation 107975. Up to 14059 conditions per place. [2023-11-24 21:42:07,229 INFO L140 encePairwiseOnDemand]: 51/67 looper letters, 78 selfloop transitions, 39 changer transitions 136/271 dead transitions. [2023-11-24 21:42:07,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 271 transitions, 2548 flow [2023-11-24 21:42:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 21:42:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-24 21:42:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 586 transitions. [2023-11-24 21:42:07,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6727898966704937 [2023-11-24 21:42:07,233 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 586 transitions. [2023-11-24 21:42:07,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 586 transitions. [2023-11-24 21:42:07,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:07,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 586 transitions. [2023-11-24 21:42:07,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 45.07692307692308) internal successors, (586), 13 states have internal predecessors, (586), 0 states have call successors, (0), 0 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-24 21:42:07,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 67.0) internal successors, (938), 14 states have internal predecessors, (938), 0 states have call successors, (0), 0 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-24 21:42:07,239 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 67.0) internal successors, (938), 14 states have internal predecessors, (938), 0 states have call successors, (0), 0 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-24 21:42:07,239 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 666 flow. Second operand 13 states and 586 transitions. [2023-11-24 21:42:07,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 271 transitions, 2548 flow [2023-11-24 21:42:07,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 271 transitions, 2428 flow, removed 39 selfloop flow, removed 5 redundant places. [2023-11-24 21:42:07,653 INFO L231 Difference]: Finished difference. Result has 110 places, 91 transitions, 762 flow [2023-11-24 21:42:07,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=762, PETRI_PLACES=110, PETRI_TRANSITIONS=91} [2023-11-24 21:42:07,654 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 36 predicate places. [2023-11-24 21:42:07,654 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 91 transitions, 762 flow [2023-11-24 21:42:07,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-24 21:42:07,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:07,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:07,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:42:07,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:42:07,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1807499381, now seen corresponding path program 2 times [2023-11-24 21:42:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:07,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356243353] [2023-11-24 21:42:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:08,161 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-24 21:42:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356243353] [2023-11-24 21:42:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356243353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:42:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421353125] [2023-11-24 21:42:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:08,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:42:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:08,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:42:08,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:42:08,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:42:08,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 91 transitions, 762 flow. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 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-24 21:42:08,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:08,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:42:08,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:11,202 INFO L124 PetriNetUnfolderBase]: 10796/16406 cut-off events. [2023-11-24 21:42:11,202 INFO L125 PetriNetUnfolderBase]: For 134080/136739 co-relation queries the response was YES. [2023-11-24 21:42:11,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94999 conditions, 16406 events. 10796/16406 cut-off events. For 134080/136739 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 113736 event pairs, 3267 based on Foata normal form. 362/15703 useless extension candidates. Maximal degree in co-relation 94959. Up to 9060 conditions per place. [2023-11-24 21:42:11,397 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 68 selfloop transitions, 20 changer transitions 70/198 dead transitions. [2023-11-24 21:42:11,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 198 transitions, 2207 flow [2023-11-24 21:42:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:42:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:42:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 465 transitions. [2023-11-24 21:42:11,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6940298507462687 [2023-11-24 21:42:11,400 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 465 transitions. [2023-11-24 21:42:11,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 465 transitions. [2023-11-24 21:42:11,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:11,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 465 transitions. [2023-11-24 21:42:11,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 46.5) internal successors, (465), 10 states have internal predecessors, (465), 0 states have call successors, (0), 0 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-24 21:42:11,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-24 21:42:11,404 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-24 21:42:11,404 INFO L175 Difference]: Start difference. First operand has 110 places, 91 transitions, 762 flow. Second operand 10 states and 465 transitions. [2023-11-24 21:42:11,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 198 transitions, 2207 flow [2023-11-24 21:42:12,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 198 transitions, 2096 flow, removed 42 selfloop flow, removed 12 redundant places. [2023-11-24 21:42:12,191 INFO L231 Difference]: Finished difference. Result has 96 places, 99 transitions, 935 flow [2023-11-24 21:42:12,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=935, PETRI_PLACES=96, PETRI_TRANSITIONS=99} [2023-11-24 21:42:12,192 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-11-24 21:42:12,192 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 99 transitions, 935 flow [2023-11-24 21:42:12,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 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-24 21:42:12,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:12,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:12,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:42:12,194 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:42:12,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2036655515, now seen corresponding path program 1 times [2023-11-24 21:42:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:12,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723786864] [2023-11-24 21:42:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:13,017 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-24 21:42:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723786864] [2023-11-24 21:42:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723786864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:42:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506745827] [2023-11-24 21:42:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:13,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:42:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:42:13,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:42:13,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:42:13,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 99 transitions, 935 flow. Second operand has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-24 21:42:13,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:13,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:42:13,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:16,992 INFO L124 PetriNetUnfolderBase]: 11902/18111 cut-off events. [2023-11-24 21:42:16,992 INFO L125 PetriNetUnfolderBase]: For 190286/192544 co-relation queries the response was YES. [2023-11-24 21:42:17,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113252 conditions, 18111 events. 11902/18111 cut-off events. For 190286/192544 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 126495 event pairs, 2757 based on Foata normal form. 383/17163 useless extension candidates. Maximal degree in co-relation 113215. Up to 10359 conditions per place. [2023-11-24 21:42:17,256 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 70 selfloop transitions, 34 changer transitions 73/217 dead transitions. [2023-11-24 21:42:17,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 217 transitions, 2569 flow [2023-11-24 21:42:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:42:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:42:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 516 transitions. [2023-11-24 21:42:17,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7001356852103121 [2023-11-24 21:42:17,259 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 516 transitions. [2023-11-24 21:42:17,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 516 transitions. [2023-11-24 21:42:17,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:17,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 516 transitions. [2023-11-24 21:42:17,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 46.90909090909091) internal successors, (516), 11 states have internal predecessors, (516), 0 states have call successors, (0), 0 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-24 21:42:17,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 67.0) internal successors, (804), 12 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-24 21:42:17,265 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 67.0) internal successors, (804), 12 states have internal predecessors, (804), 0 states have call successors, (0), 0 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-24 21:42:17,265 INFO L175 Difference]: Start difference. First operand has 96 places, 99 transitions, 935 flow. Second operand 11 states and 516 transitions. [2023-11-24 21:42:17,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 217 transitions, 2569 flow