./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme --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 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:02:47,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:02:47,230 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 12:02:47,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:02:47,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:02:47,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:02:47,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:02:47,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:02:47,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:02:47,282 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:02:47,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:02:47,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:02:47,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:02:47,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:02:47,287 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:02:47,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:02:47,288 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:02:47,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:02:47,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:02:47,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:02:47,290 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:02:47,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:02:47,291 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:02:47,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:02:47,292 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:02:47,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:02:47,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:02:47,294 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:02:47,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:02:47,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:02:47,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:02:47,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:02:47,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:47,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:02:47,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:02:47,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:02:47,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:02:47,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:02:47,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:02:47,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:02:47,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:02:47,300 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_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/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_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2023-11-26 12:02:47,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:02:47,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:02:47,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:02:47,650 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:02:47,651 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:02:47,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2023-11-26 12:02:50,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:02:51,197 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:02:51,200 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2023-11-26 12:02:51,224 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/data/6360dc32e/4c913d6fe5e8421a93658ccccbc5eaf5/FLAGaa31a4024 [2023-11-26 12:02:51,249 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/data/6360dc32e/4c913d6fe5e8421a93658ccccbc5eaf5 [2023-11-26 12:02:51,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:02:51,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:02:51,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:51,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:02:51,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:02:51,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:51" (1/1) ... [2023-11-26 12:02:51,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248158c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:51, skipping insertion in model container [2023-11-26 12:02:51,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:51" (1/1) ... [2023-11-26 12:02:51,355 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:02:51,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:51,946 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:02:52,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:52,057 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:02:52,058 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:02:52,066 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:02:52,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52 WrapperNode [2023-11-26 12:02:52,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:52,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:52,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:02:52,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:02:52,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,167 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 186 [2023-11-26 12:02:52,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:52,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:02:52,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:02:52,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:02:52,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,236 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 14, 1, 1, 1]. 74 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 7 writes are split as follows [0, 4, 1, 1, 1]. [2023-11-26 12:02:52,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:02:52,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:02:52,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:02:52,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:02:52,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (1/1) ... [2023-11-26 12:02:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:52,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:52,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:52,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:02:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 12:02:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 12:02:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 12:02:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 12:02:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 12:02:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:02:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:02:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:02:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:02:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 12:02:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:02:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:02:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:02:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:02:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:02:52,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:02:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:02:52,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:02:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:02:52,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:02:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:02:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:02:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:02:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:02:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 12:02:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:02:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:02:52,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:02:52,399 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:02:52,640 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:02:52,643 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:02:53,258 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:02:54,001 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:02:54,002 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:02:54,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:54 BoogieIcfgContainer [2023-11-26 12:02:54,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:02:54,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:02:54,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:02:54,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:02:54,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:02:51" (1/3) ... [2023-11-26 12:02:54,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3e7235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:54, skipping insertion in model container [2023-11-26 12:02:54,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:52" (2/3) ... [2023-11-26 12:02:54,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3e7235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:54, skipping insertion in model container [2023-11-26 12:02:54,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:54" (3/3) ... [2023-11-26 12:02:54,014 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2023-11-26 12:02:54,034 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:02:54,034 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-11-26 12:02:54,035 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:02:54,167 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:02:54,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow [2023-11-26 12:02:54,285 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events. [2023-11-26 12:02:54,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:54,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 247 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-26 12:02:54,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow [2023-11-26 12:02:54,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow [2023-11-26 12:02:54,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:02:54,328 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;@5c8221e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:02:54,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-26 12:02:54,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:02:54,334 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 12:02:54,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:54,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:54,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:02:54,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:02:54,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash 24600, now seen corresponding path program 1 times [2023-11-26 12:02:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:54,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491049821] [2023-11-26 12:02:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:54,800 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-26 12:02:54,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491049821] [2023-11-26 12:02:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491049821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959472343] [2023-11-26 12:02:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:54,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:54,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-26 12:02:54,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-26 12:02:54,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:54,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-26 12:02:54,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:56,523 INFO L124 PetriNetUnfolderBase]: 2900/4797 cut-off events. [2023-11-26 12:02:56,523 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-26 12:02:56,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9116 conditions, 4797 events. 2900/4797 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 37493 event pairs, 2506 based on Foata normal form. 180/3028 useless extension candidates. Maximal degree in co-relation 9102. Up to 3708 conditions per place. [2023-11-26 12:02:56,586 INFO L140 encePairwiseOnDemand]: 60/79 looper letters, 45 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-11-26 12:02:56,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 245 flow [2023-11-26 12:02:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2023-11-26 12:02:56,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6708860759493671 [2023-11-26 12:02:56,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 159 transitions. [2023-11-26 12:02:56,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 159 transitions. [2023-11-26 12:02:56,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:56,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 159 transitions. [2023-11-26 12:02:56,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-26 12:02:56,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:02:56,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:02:56,616 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 159 transitions. [2023-11-26 12:02:56,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 245 flow [2023-11-26 12:02:56,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 12:02:56,624 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-26 12:02:56,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, 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=126, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-11-26 12:02:56,631 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -17 predicate places. [2023-11-26 12:02:56,632 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-26 12:02:56,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-26 12:02:56,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:56,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 12:02:56,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:02:56,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:02:56,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash 24601, now seen corresponding path program 1 times [2023-11-26 12:02:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851137082] [2023-11-26 12:02:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:56,780 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-26 12:02:56,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:56,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851137082] [2023-11-26 12:02:56,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851137082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:02:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793654121] [2023-11-26 12:02:56,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:56,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:56,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:56,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-26 12:02:56,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-26 12:02:56,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:56,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-26 12:02:56,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:57,999 INFO L124 PetriNetUnfolderBase]: 2900/4796 cut-off events. [2023-11-26 12:02:57,999 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-26 12:02:58,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9203 conditions, 4796 events. 2900/4796 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 37465 event pairs, 2506 based on Foata normal form. 1/2848 useless extension candidates. Maximal degree in co-relation 9192. Up to 3707 conditions per place. [2023-11-26 12:02:58,102 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 44 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-26 12:02:58,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 242 flow [2023-11-26 12:02:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-26 12:02:58,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5527426160337553 [2023-11-26 12:02:58,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-26 12:02:58,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-26 12:02:58,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:58,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-26 12:02:58,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:02:58,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:02:58,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:02:58,123 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 3 states and 131 transitions. [2023-11-26 12:02:58,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 242 flow [2023-11-26 12:02:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:58,134 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2023-11-26 12:02:58,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, 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=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-26 12:02:58,136 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2023-11-26 12:02:58,136 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2023-11-26 12:02:58,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-26 12:02:58,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:58,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:58,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:02:58,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:02:58,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 733658671, now seen corresponding path program 1 times [2023-11-26 12:02:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054173443] [2023-11-26 12:02:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:02:58,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054173443] [2023-11-26 12:02:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054173443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:58,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:58,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:58,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607093516] [2023-11-26 12:02:58,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:58,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:58,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-26 12:02:58,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-26 12:02:58,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:58,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-26 12:02:58,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:59,227 INFO L124 PetriNetUnfolderBase]: 1741/3111 cut-off events. [2023-11-26 12:02:59,227 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-26 12:02:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5856 conditions, 3111 events. 1741/3111 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 24548 event pairs, 1311 based on Foata normal form. 0/2189 useless extension candidates. Maximal degree in co-relation 5844. Up to 1911 conditions per place. [2023-11-26 12:02:59,260 INFO L140 encePairwiseOnDemand]: 70/79 looper letters, 49 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2023-11-26 12:02:59,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 268 flow [2023-11-26 12:02:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:02:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2023-11-26 12:02:59,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5474683544303798 [2023-11-26 12:02:59,263 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 173 transitions. [2023-11-26 12:02:59,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 173 transitions. [2023-11-26 12:02:59,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:59,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 173 transitions. [2023-11-26 12:02:59,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-26 12:02:59,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:02:59,269 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:02:59,269 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 4 states and 173 transitions. [2023-11-26 12:02:59,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 268 flow [2023-11-26 12:02:59,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:02:59,277 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 152 flow [2023-11-26 12:02:59,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-26 12:02:59,279 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places. [2023-11-26 12:02:59,279 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 152 flow [2023-11-26 12:02:59,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-26 12:02:59,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:59,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:02:59,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:02:59,281 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:02:59,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash 733658672, now seen corresponding path program 1 times [2023-11-26 12:02:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448614976] [2023-11-26 12:02:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:59,508 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-26 12:02:59,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448614976] [2023-11-26 12:02:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448614976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:59,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461480565] [2023-11-26 12:02:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:02:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:59,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:02:59,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:02:59,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-26 12:02:59,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-26 12:02:59,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:59,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-26 12:02:59,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:59,977 INFO L124 PetriNetUnfolderBase]: 806/1552 cut-off events. [2023-11-26 12:02:59,977 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2023-11-26 12:02:59,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3292 conditions, 1552 events. 806/1552 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11784 event pairs, 590 based on Foata normal form. 210/1561 useless extension candidates. Maximal degree in co-relation 3278. Up to 809 conditions per place. [2023-11-26 12:02:59,991 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-26 12:02:59,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 230 flow [2023-11-26 12:02:59,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:02:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:02:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2023-11-26 12:02:59,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49683544303797467 [2023-11-26 12:02:59,993 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 157 transitions. [2023-11-26 12:02:59,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 157 transitions. [2023-11-26 12:02:59,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:59,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 157 transitions. [2023-11-26 12:02:59,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-26 12:02:59,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:02:59,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:02:59,997 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 152 flow. Second operand 4 states and 157 transitions. [2023-11-26 12:02:59,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 230 flow [2023-11-26 12:03:00,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:03:00,002 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 144 flow [2023-11-26 12:03:00,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=4, PETRI_FLOW=144, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2023-11-26 12:03:00,004 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places. [2023-11-26 12:03:00,004 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 144 flow [2023-11-26 12:03:00,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-26 12:03:00,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:00,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:03:00,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:03:00,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:00,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash 733657348, now seen corresponding path program 1 times [2023-11-26 12:03:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:00,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158180500] [2023-11-26 12:03:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:00,093 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-26 12:03:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158180500] [2023-11-26 12:03:00,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158180500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:00,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:00,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:00,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934530668] [2023-11-26 12:03:00,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:00,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:00,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:00,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:00,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-26 12:03:00,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-26 12:03:00,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:00,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-26 12:03:00,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:00,635 INFO L124 PetriNetUnfolderBase]: 808/1551 cut-off events. [2023-11-26 12:03:00,635 INFO L125 PetriNetUnfolderBase]: For 389/389 co-relation queries the response was YES. [2023-11-26 12:03:00,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1551 events. 808/1551 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11865 event pairs, 444 based on Foata normal form. 0/1356 useless extension candidates. Maximal degree in co-relation 3313. Up to 810 conditions per place. [2023-11-26 12:03:00,649 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-26 12:03:00,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 232 flow [2023-11-26 12:03:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 12:03:00,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2023-11-26 12:03:00,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 12:03:00,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 12:03:00,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:00,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 12:03:00,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 12:03:00,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:00,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:00,655 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 144 flow. Second operand 3 states and 116 transitions. [2023-11-26 12:03:00,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 232 flow [2023-11-26 12:03:00,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:00,659 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 143 flow [2023-11-26 12:03:00,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=62, 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=143, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-11-26 12:03:00,660 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places. [2023-11-26 12:03:00,661 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 143 flow [2023-11-26 12:03:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-26 12:03:00,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:00,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 12:03:00,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:03:00,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:00,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash 733657349, now seen corresponding path program 1 times [2023-11-26 12:03:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:00,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790770550] [2023-11-26 12:03:00,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:00,735 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-26 12:03:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790770550] [2023-11-26 12:03:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790770550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:00,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:00,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39694854] [2023-11-26 12:03:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:00,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:00,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:00,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:00,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-26 12:03:00,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-26 12:03:00,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:00,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-26 12:03:00,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:01,236 INFO L124 PetriNetUnfolderBase]: 806/1546 cut-off events. [2023-11-26 12:03:01,236 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-11-26 12:03:01,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1546 events. 806/1546 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11747 event pairs, 444 based on Foata normal form. 3/1355 useless extension candidates. Maximal degree in co-relation 3335. Up to 805 conditions per place. [2023-11-26 12:03:01,277 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 33 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-26 12:03:01,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 229 flow [2023-11-26 12:03:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-26 12:03:01,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978902953586498 [2023-11-26 12:03:01,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-26 12:03:01,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-26 12:03:01,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:01,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-26 12:03:01,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-26 12:03:01,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:01,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:01,281 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 143 flow. Second operand 3 states and 118 transitions. [2023-11-26 12:03:01,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 229 flow [2023-11-26 12:03:01,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:01,284 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 141 flow [2023-11-26 12:03:01,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=141, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-11-26 12:03:01,285 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -21 predicate places. [2023-11-26 12:03:01,285 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 141 flow [2023-11-26 12:03:01,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-26 12:03:01,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:01,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:03:01,286 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:01,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash -701712976, now seen corresponding path program 1 times [2023-11-26 12:03:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:01,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331511163] [2023-11-26 12:03:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:01,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:01,335 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-26 12:03:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331511163] [2023-11-26 12:03:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331511163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:01,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661700106] [2023-11-26 12:03:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:01,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:01,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-26 12:03:01,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-26 12:03:01,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:01,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-26 12:03:01,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:01,741 INFO L124 PetriNetUnfolderBase]: 813/1544 cut-off events. [2023-11-26 12:03:01,741 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2023-11-26 12:03:01,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1544 events. 813/1544 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11698 event pairs, 450 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 3348. Up to 803 conditions per place. [2023-11-26 12:03:01,754 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 34 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-26 12:03:01,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 229 flow [2023-11-26 12:03:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-26 12:03:01,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48945147679324896 [2023-11-26 12:03:01,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-26 12:03:01,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-26 12:03:01,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:01,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-26 12:03:01,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 12:03:01,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:01,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:01,758 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 141 flow. Second operand 3 states and 116 transitions. [2023-11-26 12:03:01,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 229 flow [2023-11-26 12:03:01,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:01,761 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 139 flow [2023-11-26 12:03:01,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-26 12:03:01,763 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places. [2023-11-26 12:03:01,763 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 139 flow [2023-11-26 12:03:01,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-26 12:03:01,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:01,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:01,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:03:01,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:01,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash -701712975, now seen corresponding path program 1 times [2023-11-26 12:03:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43036851] [2023-11-26 12:03:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:01,839 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-26 12:03:01,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43036851] [2023-11-26 12:03:01,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43036851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:01,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:01,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804628077] [2023-11-26 12:03:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:01,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:01,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:01,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-26 12:03:01,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-26 12:03:01,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:01,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-26 12:03:01,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:02,266 INFO L124 PetriNetUnfolderBase]: 806/1531 cut-off events. [2023-11-26 12:03:02,266 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2023-11-26 12:03:02,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 1531 events. 806/1531 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11544 event pairs, 447 based on Foata normal form. 6/1357 useless extension candidates. Maximal degree in co-relation 3323. Up to 790 conditions per place. [2023-11-26 12:03:02,287 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 33 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 12:03:02,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 225 flow [2023-11-26 12:03:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-26 12:03:02,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978902953586498 [2023-11-26 12:03:02,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-26 12:03:02,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-26 12:03:02,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:02,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-26 12:03:02,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-26 12:03:02,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:02,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:02,310 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 139 flow. Second operand 3 states and 118 transitions. [2023-11-26 12:03:02,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 225 flow [2023-11-26 12:03:02,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:02,312 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 137 flow [2023-11-26 12:03:02,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-11-26 12:03:02,316 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-26 12:03:02,316 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 137 flow [2023-11-26 12:03:02,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-26 12:03:02,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:02,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:02,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:03:02,317 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:02,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash -503961150, now seen corresponding path program 1 times [2023-11-26 12:03:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70781557] [2023-11-26 12:03:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:02,456 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-26 12:03:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70781557] [2023-11-26 12:03:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70781557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:02,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:03:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562502093] [2023-11-26 12:03:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:02,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:02,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:02,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-26 12:03:02,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-26 12:03:02,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:02,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-26 12:03:02,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:02,803 INFO L124 PetriNetUnfolderBase]: 649/1227 cut-off events. [2023-11-26 12:03:02,803 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2023-11-26 12:03:02,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 1227 events. 649/1227 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8513 event pairs, 118 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2726. Up to 850 conditions per place. [2023-11-26 12:03:02,813 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 40 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-26 12:03:02,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 265 flow [2023-11-26 12:03:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-26 12:03:02,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358649789029536 [2023-11-26 12:03:02,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-26 12:03:02,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-26 12:03:02,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:02,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-26 12:03:02,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-26 12:03:02,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:02,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:02,817 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 137 flow. Second operand 3 states and 127 transitions. [2023-11-26 12:03:02,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 265 flow [2023-11-26 12:03:02,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 62 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:02,820 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 135 flow [2023-11-26 12:03:02,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-26 12:03:02,822 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2023-11-26 12:03:02,822 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 135 flow [2023-11-26 12:03:02,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-26 12:03:02,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:02,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:02,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:03:02,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:02,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash 928460070, now seen corresponding path program 1 times [2023-11-26 12:03:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960339112] [2023-11-26 12:03:02,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:02,948 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-26 12:03:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960339112] [2023-11-26 12:03:02,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960339112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:02,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:02,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:03:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976672179] [2023-11-26 12:03:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:02,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:02,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-26 12:03:02,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-26 12:03:02,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:02,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-26 12:03:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:03,299 INFO L124 PetriNetUnfolderBase]: 613/1330 cut-off events. [2023-11-26 12:03:03,299 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2023-11-26 12:03:03,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 1330 events. 613/1330 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10275 event pairs, 193 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 2801. Up to 721 conditions per place. [2023-11-26 12:03:03,308 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 43 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-11-26 12:03:03,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 289 flow [2023-11-26 12:03:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-11-26 12:03:03,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5569620253164557 [2023-11-26 12:03:03,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 132 transitions. [2023-11-26 12:03:03,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 132 transitions. [2023-11-26 12:03:03,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:03,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 132 transitions. [2023-11-26 12:03:03,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-26 12:03:03,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:03,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-26 12:03:03,313 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 135 flow. Second operand 3 states and 132 transitions. [2023-11-26 12:03:03,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 289 flow [2023-11-26 12:03:03,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:03,316 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 144 flow [2023-11-26 12:03:03,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-11-26 12:03:03,317 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-26 12:03:03,317 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 144 flow [2023-11-26 12:03:03,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-26 12:03:03,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:03,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:03,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:03:03,318 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:03,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1103001067, now seen corresponding path program 1 times [2023-11-26 12:03:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:03,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972537919] [2023-11-26 12:03:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:03,426 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-26 12:03:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972537919] [2023-11-26 12:03:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972537919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:03,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:03:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465268031] [2023-11-26 12:03:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:03,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:03:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:03:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:03:03,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-26 12:03:03,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-26 12:03:03,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:03,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-26 12:03:03,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:03,830 INFO L124 PetriNetUnfolderBase]: 601/1326 cut-off events. [2023-11-26 12:03:03,830 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-26 12:03:03,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1326 events. 601/1326 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10259 event pairs, 121 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 2911. Up to 548 conditions per place. [2023-11-26 12:03:03,840 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 42 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2023-11-26 12:03:03,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 290 flow [2023-11-26 12:03:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:03:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:03:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2023-11-26 12:03:03,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221518987341772 [2023-11-26 12:03:03,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 165 transitions. [2023-11-26 12:03:03,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 165 transitions. [2023-11-26 12:03:03,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:03,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 165 transitions. [2023-11-26 12:03:03,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-26 12:03:03,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:03:03,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:03:03,845 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 144 flow. Second operand 4 states and 165 transitions. [2023-11-26 12:03:03,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 290 flow [2023-11-26 12:03:03,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:03,848 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 152 flow [2023-11-26 12:03:03,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-11-26 12:03:03,848 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-26 12:03:03,849 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 152 flow [2023-11-26 12:03:03,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-26 12:03:03,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:03,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:03,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:03:03,850 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:03,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash -851451570, now seen corresponding path program 1 times [2023-11-26 12:03:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:03,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274244115] [2023-11-26 12:03:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:04,193 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-26 12:03:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274244115] [2023-11-26 12:03:04,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274244115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:04,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:04,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:03:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50085688] [2023-11-26 12:03:04,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:04,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:04,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:04,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:04,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2023-11-26 12:03:04,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-26 12:03:04,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:04,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2023-11-26 12:03:04,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:04,598 INFO L124 PetriNetUnfolderBase]: 573/1282 cut-off events. [2023-11-26 12:03:04,598 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2023-11-26 12:03:04,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1282 events. 573/1282 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9924 event pairs, 193 based on Foata normal form. 16/1265 useless extension candidates. Maximal degree in co-relation 2843. Up to 664 conditions per place. [2023-11-26 12:03:04,609 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 41 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-11-26 12:03:04,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 292 flow [2023-11-26 12:03:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:03:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:03:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-11-26 12:03:04,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-26 12:03:04,612 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 158 transitions. [2023-11-26 12:03:04,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 158 transitions. [2023-11-26 12:03:04,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:04,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 158 transitions. [2023-11-26 12:03:04,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.5) internal successors, (158), 4 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-26 12:03:04,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:03:04,615 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:03:04,615 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 152 flow. Second operand 4 states and 158 transitions. [2023-11-26 12:03:04,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 292 flow [2023-11-26 12:03:04,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:04,618 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 146 flow [2023-11-26 12:03:04,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-11-26 12:03:04,619 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-26 12:03:04,619 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 146 flow [2023-11-26 12:03:04,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-26 12:03:04,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:04,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:04,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:03:04,620 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:04,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 831108348, now seen corresponding path program 1 times [2023-11-26 12:03:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112617641] [2023-11-26 12:03:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:05,470 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-26 12:03:05,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112617641] [2023-11-26 12:03:05,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112617641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:05,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:05,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:03:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954770889] [2023-11-26 12:03:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:03:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:03:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:03:05,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 79 [2023-11-26 12:03:05,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 146 flow. Second operand has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-26 12:03:05,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:05,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 79 [2023-11-26 12:03:05,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:06,432 INFO L124 PetriNetUnfolderBase]: 887/1692 cut-off events. [2023-11-26 12:03:06,433 INFO L125 PetriNetUnfolderBase]: For 762/762 co-relation queries the response was YES. [2023-11-26 12:03:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3886 conditions, 1692 events. 887/1692 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 12906 event pairs, 497 based on Foata normal form. 0/1615 useless extension candidates. Maximal degree in co-relation 3869. Up to 483 conditions per place. [2023-11-26 12:03:06,449 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 59 selfloop transitions, 9 changer transitions 2/87 dead transitions. [2023-11-26 12:03:06,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 416 flow [2023-11-26 12:03:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:03:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:03:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2023-11-26 12:03:06,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267631103074141 [2023-11-26 12:03:06,452 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 236 transitions. [2023-11-26 12:03:06,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 236 transitions. [2023-11-26 12:03:06,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:06,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 236 transitions. [2023-11-26 12:03:06,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 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-26 12:03:06,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:06,456 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:06,456 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 146 flow. Second operand 7 states and 236 transitions. [2023-11-26 12:03:06,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 416 flow [2023-11-26 12:03:06,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:06,460 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 212 flow [2023-11-26 12:03:06,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-11-26 12:03:06,461 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -14 predicate places. [2023-11-26 12:03:06,462 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 212 flow [2023-11-26 12:03:06,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-26 12:03:06,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:06,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:06,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:03:06,463 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:06,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash 831107717, now seen corresponding path program 1 times [2023-11-26 12:03:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:06,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772656170] [2023-11-26 12:03:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:06,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:06,664 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-26 12:03:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772656170] [2023-11-26 12:03:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772656170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:06,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:06,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:03:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142198670] [2023-11-26 12:03:06,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:06,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:06,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:06,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2023-11-26 12:03:06,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-26 12:03:06,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:06,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2023-11-26 12:03:06,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:07,746 INFO L124 PetriNetUnfolderBase]: 2845/5260 cut-off events. [2023-11-26 12:03:07,746 INFO L125 PetriNetUnfolderBase]: For 4012/4092 co-relation queries the response was YES. [2023-11-26 12:03:07,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12842 conditions, 5260 events. 2845/5260 cut-off events. For 4012/4092 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 43891 event pairs, 568 based on Foata normal form. 0/5080 useless extension candidates. Maximal degree in co-relation 12821. Up to 2195 conditions per place. [2023-11-26 12:03:07,787 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 88 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2023-11-26 12:03:07,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 744 flow [2023-11-26 12:03:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:03:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:03:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 294 transitions. [2023-11-26 12:03:07,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651898734177215 [2023-11-26 12:03:07,790 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 294 transitions. [2023-11-26 12:03:07,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 294 transitions. [2023-11-26 12:03:07,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:07,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 294 transitions. [2023-11-26 12:03:07,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.75) internal successors, (294), 8 states have internal predecessors, (294), 0 states have call successors, (0), 0 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-26 12:03:07,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 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-26 12:03:07,794 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 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-26 12:03:07,794 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 212 flow. Second operand 8 states and 294 transitions. [2023-11-26 12:03:07,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 744 flow [2023-11-26 12:03:07,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 721 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-26 12:03:07,808 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 335 flow [2023-11-26 12:03:07,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=335, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2023-11-26 12:03:07,809 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2023-11-26 12:03:07,810 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 335 flow [2023-11-26 12:03:07,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-26 12:03:07,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:07,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:07,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:03:07,811 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:07,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 428180023, now seen corresponding path program 1 times [2023-11-26 12:03:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270371368] [2023-11-26 12:03:07,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:08,199 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-26 12:03:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:08,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270371368] [2023-11-26 12:03:08,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270371368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593585837] [2023-11-26 12:03:08,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:08,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:03:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:03:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:03:08,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-26 12:03:08,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-26 12:03:08,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:08,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-26 12:03:08,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:08,770 INFO L124 PetriNetUnfolderBase]: 1112/2320 cut-off events. [2023-11-26 12:03:08,770 INFO L125 PetriNetUnfolderBase]: For 2142/2158 co-relation queries the response was YES. [2023-11-26 12:03:08,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6075 conditions, 2320 events. 1112/2320 cut-off events. For 2142/2158 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19170 event pairs, 629 based on Foata normal form. 64/2282 useless extension candidates. Maximal degree in co-relation 6049. Up to 1040 conditions per place. [2023-11-26 12:03:08,786 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 28 selfloop transitions, 8 changer transitions 10/69 dead transitions. [2023-11-26 12:03:08,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 69 transitions, 427 flow [2023-11-26 12:03:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:03:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:03:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2023-11-26 12:03:08,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41350210970464135 [2023-11-26 12:03:08,788 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 196 transitions. [2023-11-26 12:03:08,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 196 transitions. [2023-11-26 12:03:08,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:08,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 196 transitions. [2023-11-26 12:03:08,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-26 12:03:08,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:08,791 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:08,791 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 335 flow. Second operand 6 states and 196 transitions. [2023-11-26 12:03:08,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 69 transitions, 427 flow [2023-11-26 12:03:08,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 69 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:08,807 INFO L231 Difference]: Finished difference. Result has 80 places, 52 transitions, 232 flow [2023-11-26 12:03:08,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=80, PETRI_TRANSITIONS=52} [2023-11-26 12:03:08,808 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2023-11-26 12:03:08,808 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 52 transitions, 232 flow [2023-11-26 12:03:08,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-26 12:03:08,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:08,808 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] [2023-11-26 12:03:08,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:03:08,809 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:08,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 54740397, now seen corresponding path program 1 times [2023-11-26 12:03:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037065445] [2023-11-26 12:03:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:10,429 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-26 12:03:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037065445] [2023-11-26 12:03:10,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037065445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:10,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:10,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 12:03:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729732398] [2023-11-26 12:03:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:10,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 12:03:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:10,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 12:03:10,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-26 12:03:10,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 79 [2023-11-26 12:03:10,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 52 transitions, 232 flow. Second operand has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 0 states have call successors, (0), 0 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-26 12:03:10,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:10,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 79 [2023-11-26 12:03:10,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:11,520 INFO L124 PetriNetUnfolderBase]: 920/1922 cut-off events. [2023-11-26 12:03:11,520 INFO L125 PetriNetUnfolderBase]: For 1654/1656 co-relation queries the response was YES. [2023-11-26 12:03:11,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 1922 events. 920/1922 cut-off events. For 1654/1656 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15172 event pairs, 372 based on Foata normal form. 50/1905 useless extension candidates. Maximal degree in co-relation 4801. Up to 1082 conditions per place. [2023-11-26 12:03:11,534 INFO L140 encePairwiseOnDemand]: 70/79 looper letters, 41 selfloop transitions, 10 changer transitions 26/94 dead transitions. [2023-11-26 12:03:11,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 572 flow [2023-11-26 12:03:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:03:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:03:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 274 transitions. [2023-11-26 12:03:11,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853727144866385 [2023-11-26 12:03:11,537 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 274 transitions. [2023-11-26 12:03:11,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 274 transitions. [2023-11-26 12:03:11,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:11,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 274 transitions. [2023-11-26 12:03:11,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 30.444444444444443) internal successors, (274), 9 states have internal predecessors, (274), 0 states have call successors, (0), 0 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-26 12:03:11,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 79.0) internal successors, (790), 10 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:11,541 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 79.0) internal successors, (790), 10 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:11,541 INFO L175 Difference]: Start difference. First operand has 80 places, 52 transitions, 232 flow. Second operand 9 states and 274 transitions. [2023-11-26 12:03:11,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 572 flow [2023-11-26 12:03:11,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 94 transitions, 545 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 12:03:11,551 INFO L231 Difference]: Finished difference. Result has 81 places, 45 transitions, 182 flow [2023-11-26 12:03:11,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=81, PETRI_TRANSITIONS=45} [2023-11-26 12:03:11,552 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2023-11-26 12:03:11,552 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 45 transitions, 182 flow [2023-11-26 12:03:11,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 0 states have call successors, (0), 0 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-26 12:03:11,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:11,553 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] [2023-11-26 12:03:11,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 12:03:11,553 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:11,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash -418108604, now seen corresponding path program 1 times [2023-11-26 12:03:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035283333] [2023-11-26 12:03:11,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:11,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:11,759 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-26 12:03:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035283333] [2023-11-26 12:03:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035283333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:11,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635016178] [2023-11-26 12:03:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:11,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:11,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:11,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:11,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:11,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 79 [2023-11-26 12:03:11,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 45 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-26 12:03:11,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:11,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 79 [2023-11-26 12:03:11,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:12,563 INFO L124 PetriNetUnfolderBase]: 1543/2826 cut-off events. [2023-11-26 12:03:12,564 INFO L125 PetriNetUnfolderBase]: For 2507/2509 co-relation queries the response was YES. [2023-11-26 12:03:12,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 2826 events. 1543/2826 cut-off events. For 2507/2509 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20852 event pairs, 767 based on Foata normal form. 72/2849 useless extension candidates. Maximal degree in co-relation 7582. Up to 1315 conditions per place. [2023-11-26 12:03:12,582 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 42 selfloop transitions, 2 changer transitions 46/106 dead transitions. [2023-11-26 12:03:12,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 106 transitions, 655 flow [2023-11-26 12:03:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:03:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:03:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2023-11-26 12:03:12,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43670886075949367 [2023-11-26 12:03:12,586 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 276 transitions. [2023-11-26 12:03:12,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 276 transitions. [2023-11-26 12:03:12,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:12,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 276 transitions. [2023-11-26 12:03:12,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-26 12:03:12,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 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-26 12:03:12,591 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 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-26 12:03:12,591 INFO L175 Difference]: Start difference. First operand has 81 places, 45 transitions, 182 flow. Second operand 8 states and 276 transitions. [2023-11-26 12:03:12,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 106 transitions, 655 flow [2023-11-26 12:03:12,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 106 transitions, 603 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-11-26 12:03:12,601 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 171 flow [2023-11-26 12:03:12,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=171, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2023-11-26 12:03:12,602 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2023-11-26 12:03:12,603 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 171 flow [2023-11-26 12:03:12,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-26 12:03:12,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:12,603 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-26 12:03:12,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 12:03:12,603 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:12,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1758404499, now seen corresponding path program 1 times [2023-11-26 12:03:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:12,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589546326] [2023-11-26 12:03:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:12,939 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-26 12:03:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589546326] [2023-11-26 12:03:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589546326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:12,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562961372] [2023-11-26 12:03:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:12,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:03:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:03:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:03:12,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-26 12:03:12,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 44 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 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-26 12:03:12,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:12,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-26 12:03:12,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:13,423 INFO L124 PetriNetUnfolderBase]: 636/1359 cut-off events. [2023-11-26 12:03:13,423 INFO L125 PetriNetUnfolderBase]: For 830/854 co-relation queries the response was YES. [2023-11-26 12:03:13,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3392 conditions, 1359 events. 636/1359 cut-off events. For 830/854 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9926 event pairs, 248 based on Foata normal form. 24/1346 useless extension candidates. Maximal degree in co-relation 3378. Up to 832 conditions per place. [2023-11-26 12:03:13,434 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 31 selfloop transitions, 4 changer transitions 23/76 dead transitions. [2023-11-26 12:03:13,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 411 flow [2023-11-26 12:03:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:03:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:03:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2023-11-26 12:03:13,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45207956600361665 [2023-11-26 12:03:13,437 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 250 transitions. [2023-11-26 12:03:13,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 250 transitions. [2023-11-26 12:03:13,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:13,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 250 transitions. [2023-11-26 12:03:13,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-26 12:03:13,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:13,440 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:13,441 INFO L175 Difference]: Start difference. First operand has 75 places, 44 transitions, 171 flow. Second operand 7 states and 250 transitions. [2023-11-26 12:03:13,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 411 flow [2023-11-26 12:03:13,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 391 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 12:03:13,447 INFO L231 Difference]: Finished difference. Result has 73 places, 44 transitions, 181 flow [2023-11-26 12:03:13,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=73, PETRI_TRANSITIONS=44} [2023-11-26 12:03:13,448 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -11 predicate places. [2023-11-26 12:03:13,448 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 44 transitions, 181 flow [2023-11-26 12:03:13,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 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-26 12:03:13,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:13,448 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-26 12:03:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 12:03:13,449 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:13,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -109329614, now seen corresponding path program 1 times [2023-11-26 12:03:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:13,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427379561] [2023-11-26 12:03:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:13,726 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-26 12:03:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427379561] [2023-11-26 12:03:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427379561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:13,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:03:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117122040] [2023-11-26 12:03:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:13,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:13,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:13,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2023-11-26 12:03:13,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 44 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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-26 12:03:13,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:13,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2023-11-26 12:03:13,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:14,271 INFO L124 PetriNetUnfolderBase]: 814/1525 cut-off events. [2023-11-26 12:03:14,271 INFO L125 PetriNetUnfolderBase]: For 1100/1126 co-relation queries the response was YES. [2023-11-26 12:03:14,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4078 conditions, 1525 events. 814/1525 cut-off events. For 1100/1126 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10696 event pairs, 150 based on Foata normal form. 52/1557 useless extension candidates. Maximal degree in co-relation 4063. Up to 897 conditions per place. [2023-11-26 12:03:14,285 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 31 selfloop transitions, 2 changer transitions 23/73 dead transitions. [2023-11-26 12:03:14,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 73 transitions, 402 flow [2023-11-26 12:03:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:03:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:03:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2023-11-26 12:03:14,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42495479204339964 [2023-11-26 12:03:14,287 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 235 transitions. [2023-11-26 12:03:14,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 235 transitions. [2023-11-26 12:03:14,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:14,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 235 transitions. [2023-11-26 12:03:14,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-26 12:03:14,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:14,291 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:14,291 INFO L175 Difference]: Start difference. First operand has 73 places, 44 transitions, 181 flow. Second operand 7 states and 235 transitions. [2023-11-26 12:03:14,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 73 transitions, 402 flow [2023-11-26 12:03:14,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 376 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 12:03:14,299 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 181 flow [2023-11-26 12:03:14,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-11-26 12:03:14,300 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -10 predicate places. [2023-11-26 12:03:14,300 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 181 flow [2023-11-26 12:03:14,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 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-26 12:03:14,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:14,300 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-26 12:03:14,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 12:03:14,301 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:14,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 9273717, now seen corresponding path program 1 times [2023-11-26 12:03:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553357101] [2023-11-26 12:03:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,593 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-26 12:03:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:14,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553357101] [2023-11-26 12:03:14,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553357101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:14,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:14,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300370913] [2023-11-26 12:03:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:14,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:03:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:03:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:03:14,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-26 12:03:14,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 44 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-26 12:03:14,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:14,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-26 12:03:14,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:15,441 INFO L124 PetriNetUnfolderBase]: 1898/3418 cut-off events. [2023-11-26 12:03:15,441 INFO L125 PetriNetUnfolderBase]: For 2362/2362 co-relation queries the response was YES. [2023-11-26 12:03:15,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9382 conditions, 3418 events. 1898/3418 cut-off events. For 2362/2362 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25849 event pairs, 215 based on Foata normal form. 40/3446 useless extension candidates. Maximal degree in co-relation 9366. Up to 1225 conditions per place. [2023-11-26 12:03:15,469 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 43 selfloop transitions, 3 changer transitions 29/90 dead transitions. [2023-11-26 12:03:15,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 536 flow [2023-11-26 12:03:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:03:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:03:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-26 12:03:15,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43248945147679324 [2023-11-26 12:03:15,471 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-26 12:03:15,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-26 12:03:15,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:15,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-26 12:03:15,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:15,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:15,474 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:15,474 INFO L175 Difference]: Start difference. First operand has 74 places, 44 transitions, 181 flow. Second operand 6 states and 205 transitions. [2023-11-26 12:03:15,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 536 flow [2023-11-26 12:03:15,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 518 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-26 12:03:15,486 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 183 flow [2023-11-26 12:03:15,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2023-11-26 12:03:15,486 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -12 predicate places. [2023-11-26 12:03:15,487 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 183 flow [2023-11-26 12:03:15,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-26 12:03:15,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:15,487 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-26 12:03:15,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 12:03:15,487 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:15,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1375470125, now seen corresponding path program 2 times [2023-11-26 12:03:15,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:15,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225792854] [2023-11-26 12:03:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:15,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:16,644 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-26 12:03:16,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:16,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225792854] [2023-11-26 12:03:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225792854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:16,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:03:16,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52695285] [2023-11-26 12:03:16,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:16,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:03:16,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:16,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:03:16,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:03:16,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-26 12:03:16,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-26 12:03:16,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:16,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-26 12:03:16,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:17,369 INFO L124 PetriNetUnfolderBase]: 624/1241 cut-off events. [2023-11-26 12:03:17,369 INFO L125 PetriNetUnfolderBase]: For 1128/1140 co-relation queries the response was YES. [2023-11-26 12:03:17,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 1241 events. 624/1241 cut-off events. For 1128/1140 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8460 event pairs, 62 based on Foata normal form. 40/1248 useless extension candidates. Maximal degree in co-relation 3294. Up to 527 conditions per place. [2023-11-26 12:03:17,380 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 34 selfloop transitions, 11 changer transitions 27/90 dead transitions. [2023-11-26 12:03:17,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 90 transitions, 494 flow [2023-11-26 12:03:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 12:03:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-26 12:03:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 373 transitions. [2023-11-26 12:03:17,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42922899884925203 [2023-11-26 12:03:17,383 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 373 transitions. [2023-11-26 12:03:17,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 373 transitions. [2023-11-26 12:03:17,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:17,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 373 transitions. [2023-11-26 12:03:17,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 33.90909090909091) internal successors, (373), 11 states have internal predecessors, (373), 0 states have call successors, (0), 0 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-26 12:03:17,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 79.0) internal successors, (948), 12 states have internal predecessors, (948), 0 states have call successors, (0), 0 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-26 12:03:17,389 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 79.0) internal successors, (948), 12 states have internal predecessors, (948), 0 states have call successors, (0), 0 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-26 12:03:17,389 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 183 flow. Second operand 11 states and 373 transitions. [2023-11-26 12:03:17,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 90 transitions, 494 flow [2023-11-26 12:03:17,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 464 flow, removed 11 selfloop flow, removed 6 redundant places. [2023-11-26 12:03:17,396 INFO L231 Difference]: Finished difference. Result has 83 places, 48 transitions, 254 flow [2023-11-26 12:03:17,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=254, PETRI_PLACES=83, PETRI_TRANSITIONS=48} [2023-11-26 12:03:17,397 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2023-11-26 12:03:17,397 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 48 transitions, 254 flow [2023-11-26 12:03:17,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-26 12:03:17,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:17,398 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] [2023-11-26 12:03:17,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 12:03:17,398 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:17,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1859250777, now seen corresponding path program 1 times [2023-11-26 12:03:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469343475] [2023-11-26 12:03:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,754 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-26 12:03:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:17,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469343475] [2023-11-26 12:03:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469343475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:17,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:17,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:03:17,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839223485] [2023-11-26 12:03:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:17,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:03:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:03:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:03:17,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-26 12:03:17,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 48 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-26 12:03:17,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:17,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-26 12:03:17,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:18,492 INFO L124 PetriNetUnfolderBase]: 1387/2671 cut-off events. [2023-11-26 12:03:18,493 INFO L125 PetriNetUnfolderBase]: For 4311/4311 co-relation queries the response was YES. [2023-11-26 12:03:18,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8264 conditions, 2671 events. 1387/2671 cut-off events. For 4311/4311 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 20599 event pairs, 568 based on Foata normal form. 24/2674 useless extension candidates. Maximal degree in co-relation 8244. Up to 1068 conditions per place. [2023-11-26 12:03:18,521 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 41 selfloop transitions, 2 changer transitions 43/101 dead transitions. [2023-11-26 12:03:18,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 765 flow [2023-11-26 12:03:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:03:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:03:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2023-11-26 12:03:18,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4213381555153707 [2023-11-26 12:03:18,524 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 233 transitions. [2023-11-26 12:03:18,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 233 transitions. [2023-11-26 12:03:18,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:18,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 233 transitions. [2023-11-26 12:03:18,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:18,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:18,528 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:18,528 INFO L175 Difference]: Start difference. First operand has 83 places, 48 transitions, 254 flow. Second operand 7 states and 233 transitions. [2023-11-26 12:03:18,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 765 flow [2023-11-26 12:03:18,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 699 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-11-26 12:03:18,545 INFO L231 Difference]: Finished difference. Result has 82 places, 48 transitions, 244 flow [2023-11-26 12:03:18,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=82, PETRI_TRANSITIONS=48} [2023-11-26 12:03:18,546 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2023-11-26 12:03:18,546 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 48 transitions, 244 flow [2023-11-26 12:03:18,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-26 12:03:18,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:18,546 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] [2023-11-26 12:03:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 12:03:18,547 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:18,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash -934381635, now seen corresponding path program 2 times [2023-11-26 12:03:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:18,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041958613] [2023-11-26 12:03:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,643 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-26 12:03:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041958613] [2023-11-26 12:03:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041958613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:19,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:03:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841572355] [2023-11-26 12:03:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:19,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:03:19,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:03:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:03:19,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2023-11-26 12:03:19,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 48 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-26 12:03:19,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:19,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2023-11-26 12:03:19,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:20,318 INFO L124 PetriNetUnfolderBase]: 540/1087 cut-off events. [2023-11-26 12:03:20,318 INFO L125 PetriNetUnfolderBase]: For 1539/1604 co-relation queries the response was YES. [2023-11-26 12:03:20,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3220 conditions, 1087 events. 540/1087 cut-off events. For 1539/1604 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7269 event pairs, 74 based on Foata normal form. 30/1081 useless extension candidates. Maximal degree in co-relation 3200. Up to 532 conditions per place. [2023-11-26 12:03:20,330 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 40 selfloop transitions, 12 changer transitions 15/85 dead transitions. [2023-11-26 12:03:20,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 85 transitions, 538 flow [2023-11-26 12:03:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 12:03:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 12:03:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 309 transitions. [2023-11-26 12:03:20,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4345991561181435 [2023-11-26 12:03:20,332 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 309 transitions. [2023-11-26 12:03:20,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 309 transitions. [2023-11-26 12:03:20,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:20,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 309 transitions. [2023-11-26 12:03:20,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.333333333333336) internal successors, (309), 9 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:20,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 79.0) internal successors, (790), 10 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:20,337 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 79.0) internal successors, (790), 10 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:20,337 INFO L175 Difference]: Start difference. First operand has 82 places, 48 transitions, 244 flow. Second operand 9 states and 309 transitions. [2023-11-26 12:03:20,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 85 transitions, 538 flow [2023-11-26 12:03:20,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 85 transitions, 516 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 12:03:20,345 INFO L231 Difference]: Finished difference. Result has 87 places, 57 transitions, 365 flow [2023-11-26 12:03:20,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=87, PETRI_TRANSITIONS=57} [2023-11-26 12:03:20,346 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 3 predicate places. [2023-11-26 12:03:20,346 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 57 transitions, 365 flow [2023-11-26 12:03:20,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-26 12:03:20,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:20,347 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] [2023-11-26 12:03:20,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 12:03:20,347 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:20,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1736048229, now seen corresponding path program 3 times [2023-11-26 12:03:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376584606] [2023-11-26 12:03:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:20,559 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-26 12:03:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:20,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376584606] [2023-11-26 12:03:20,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376584606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:20,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:20,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:03:20,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719167484] [2023-11-26 12:03:20,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:20,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:03:20,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:20,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:03:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:03:20,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-26 12:03:20,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 57 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 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-26 12:03:20,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:20,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-26 12:03:20,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:21,117 INFO L124 PetriNetUnfolderBase]: 1851/3023 cut-off events. [2023-11-26 12:03:21,117 INFO L125 PetriNetUnfolderBase]: For 6570/6594 co-relation queries the response was YES. [2023-11-26 12:03:21,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9763 conditions, 3023 events. 1851/3023 cut-off events. For 6570/6594 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18268 event pairs, 372 based on Foata normal form. 137/3131 useless extension candidates. Maximal degree in co-relation 9740. Up to 1705 conditions per place. [2023-11-26 12:03:21,141 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 71 selfloop transitions, 5 changer transitions 1/91 dead transitions. [2023-11-26 12:03:21,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 777 flow [2023-11-26 12:03:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:03:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:03:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2023-11-26 12:03:21,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588607594936709 [2023-11-26 12:03:21,142 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 145 transitions. [2023-11-26 12:03:21,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 145 transitions. [2023-11-26 12:03:21,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:21,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 145 transitions. [2023-11-26 12:03:21,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 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-26 12:03:21,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:03:21,145 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-26 12:03:21,145 INFO L175 Difference]: Start difference. First operand has 87 places, 57 transitions, 365 flow. Second operand 4 states and 145 transitions. [2023-11-26 12:03:21,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 777 flow [2023-11-26 12:03:21,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 91 transitions, 747 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-11-26 12:03:21,173 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 377 flow [2023-11-26 12:03:21,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-11-26 12:03:21,174 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 0 predicate places. [2023-11-26 12:03:21,174 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 377 flow [2023-11-26 12:03:21,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 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-26 12:03:21,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:21,175 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-26 12:03:21,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 12:03:21,175 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:21,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1182192500, now seen corresponding path program 1 times [2023-11-26 12:03:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870599058] [2023-11-26 12:03:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:21,447 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-26 12:03:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:21,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870599058] [2023-11-26 12:03:21,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870599058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:21,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:21,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:03:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032039505] [2023-11-26 12:03:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:21,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:21,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-26 12:03:21,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-26 12:03:21,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:21,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-26 12:03:21,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:22,073 INFO L124 PetriNetUnfolderBase]: 1371/2297 cut-off events. [2023-11-26 12:03:22,073 INFO L125 PetriNetUnfolderBase]: For 4839/4869 co-relation queries the response was YES. [2023-11-26 12:03:22,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7823 conditions, 2297 events. 1371/2297 cut-off events. For 4839/4869 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13015 event pairs, 59 based on Foata normal form. 127/2399 useless extension candidates. Maximal degree in co-relation 7801. Up to 1013 conditions per place. [2023-11-26 12:03:22,100 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 79 selfloop transitions, 8 changer transitions 1/102 dead transitions. [2023-11-26 12:03:22,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 863 flow [2023-11-26 12:03:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:03:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:03:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-26 12:03:22,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607594936708861 [2023-11-26 12:03:22,103 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-26 12:03:22,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-26 12:03:22,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:22,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-26 12:03:22,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 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-26 12:03:22,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:22,105 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:22,106 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 377 flow. Second operand 5 states and 182 transitions. [2023-11-26 12:03:22,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 863 flow [2023-11-26 12:03:22,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 102 transitions, 837 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-26 12:03:22,115 INFO L231 Difference]: Finished difference. Result has 86 places, 60 transitions, 383 flow [2023-11-26 12:03:22,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=383, PETRI_PLACES=86, PETRI_TRANSITIONS=60} [2023-11-26 12:03:22,116 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, 2 predicate places. [2023-11-26 12:03:22,117 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 60 transitions, 383 flow [2023-11-26 12:03:22,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-26 12:03:22,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:22,117 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, 1] [2023-11-26 12:03:22,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 12:03:22,118 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:22,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1811851335, now seen corresponding path program 1 times [2023-11-26 12:03:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:22,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714936267] [2023-11-26 12:03:22,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:22,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:22,391 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-26 12:03:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714936267] [2023-11-26 12:03:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714936267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:22,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:22,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907005364] [2023-11-26 12:03:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:22,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:03:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:22,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:03:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:03:22,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-26 12:03:22,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 60 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-26 12:03:22,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:22,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-26 12:03:22,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:22,792 INFO L124 PetriNetUnfolderBase]: 795/1357 cut-off events. [2023-11-26 12:03:22,792 INFO L125 PetriNetUnfolderBase]: For 3672/3712 co-relation queries the response was YES. [2023-11-26 12:03:22,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4930 conditions, 1357 events. 795/1357 cut-off events. For 3672/3712 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6763 event pairs, 39 based on Foata normal form. 79/1413 useless extension candidates. Maximal degree in co-relation 4908. Up to 548 conditions per place. [2023-11-26 12:03:22,804 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 63 selfloop transitions, 11 changer transitions 1/89 dead transitions. [2023-11-26 12:03:22,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 714 flow [2023-11-26 12:03:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:03:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:03:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-26 12:03:22,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43248945147679324 [2023-11-26 12:03:22,806 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-26 12:03:22,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-26 12:03:22,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:22,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-26 12:03:22,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:22,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:22,809 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:22,810 INFO L175 Difference]: Start difference. First operand has 86 places, 60 transitions, 383 flow. Second operand 6 states and 205 transitions. [2023-11-26 12:03:22,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 714 flow [2023-11-26 12:03:22,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 576 flow, removed 22 selfloop flow, removed 14 redundant places. [2023-11-26 12:03:22,821 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 275 flow [2023-11-26 12:03:22,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2023-11-26 12:03:22,822 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2023-11-26 12:03:22,823 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 275 flow [2023-11-26 12:03:22,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-26 12:03:22,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:22,823 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, 1, 1, 1, 1] [2023-11-26 12:03:22,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-26 12:03:22,824 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:22,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -3040891, now seen corresponding path program 1 times [2023-11-26 12:03:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:22,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267142474] [2023-11-26 12:03:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:23,148 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-26 12:03:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267142474] [2023-11-26 12:03:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267142474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:03:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445107417] [2023-11-26 12:03:23,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:23,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:03:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:03:23,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:03:23,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-26 12:03:23,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-26 12:03:23,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:23,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-26 12:03:23,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:23,641 INFO L124 PetriNetUnfolderBase]: 909/1862 cut-off events. [2023-11-26 12:03:23,641 INFO L125 PetriNetUnfolderBase]: For 1850/1890 co-relation queries the response was YES. [2023-11-26 12:03:23,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5166 conditions, 1862 events. 909/1862 cut-off events. For 1850/1890 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11741 event pairs, 343 based on Foata normal form. 16/1813 useless extension candidates. Maximal degree in co-relation 5151. Up to 705 conditions per place. [2023-11-26 12:03:23,659 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 32 selfloop transitions, 1 changer transitions 29/83 dead transitions. [2023-11-26 12:03:23,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 533 flow [2023-11-26 12:03:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:03:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:03:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2023-11-26 12:03:23,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41350210970464135 [2023-11-26 12:03:23,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 196 transitions. [2023-11-26 12:03:23,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 196 transitions. [2023-11-26 12:03:23,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:23,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 196 transitions. [2023-11-26 12:03:23,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-26 12:03:23,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:23,665 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-26 12:03:23,665 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 275 flow. Second operand 6 states and 196 transitions. [2023-11-26 12:03:23,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 533 flow [2023-11-26 12:03:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 469 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-26 12:03:23,678 INFO L231 Difference]: Finished difference. Result has 80 places, 49 transitions, 210 flow [2023-11-26 12:03:23,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=49} [2023-11-26 12:03:23,679 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2023-11-26 12:03:23,680 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 49 transitions, 210 flow [2023-11-26 12:03:23,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-26 12:03:23,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:23,680 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, 1, 1, 1, 1] [2023-11-26 12:03:23,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-26 12:03:23,681 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:23,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1611311293, now seen corresponding path program 2 times [2023-11-26 12:03:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:23,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174154096] [2023-11-26 12:03:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:23,986 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-26 12:03:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:23,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174154096] [2023-11-26 12:03:23,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174154096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:23,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:23,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:03:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911328220] [2023-11-26 12:03:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:23,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:03:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:03:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:03:24,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 79 [2023-11-26 12:03:24,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 49 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-26 12:03:24,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:24,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 79 [2023-11-26 12:03:24,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:24,487 INFO L124 PetriNetUnfolderBase]: 808/1705 cut-off events. [2023-11-26 12:03:24,488 INFO L125 PetriNetUnfolderBase]: For 931/935 co-relation queries the response was YES. [2023-11-26 12:03:24,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4206 conditions, 1705 events. 808/1705 cut-off events. For 931/935 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10859 event pairs, 517 based on Foata normal form. 16/1629 useless extension candidates. Maximal degree in co-relation 4191. Up to 731 conditions per place. [2023-11-26 12:03:24,503 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 31 selfloop transitions, 2 changer transitions 31/85 dead transitions. [2023-11-26 12:03:24,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 85 transitions, 489 flow [2023-11-26 12:03:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 12:03:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 12:03:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2023-11-26 12:03:24,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40867992766726946 [2023-11-26 12:03:24,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 226 transitions. [2023-11-26 12:03:24,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 226 transitions. [2023-11-26 12:03:24,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:24,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 226 transitions. [2023-11-26 12:03:24,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 0 states have call successors, (0), 0 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-26 12:03:24,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:24,509 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 79.0) internal successors, (632), 8 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-26 12:03:24,509 INFO L175 Difference]: Start difference. First operand has 80 places, 49 transitions, 210 flow. Second operand 7 states and 226 transitions. [2023-11-26 12:03:24,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 85 transitions, 489 flow [2023-11-26 12:03:24,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 85 transitions, 449 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-11-26 12:03:24,516 INFO L231 Difference]: Finished difference. Result has 79 places, 49 transitions, 201 flow [2023-11-26 12:03:24,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=79, PETRI_TRANSITIONS=49} [2023-11-26 12:03:24,522 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -5 predicate places. [2023-11-26 12:03:24,522 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 49 transitions, 201 flow [2023-11-26 12:03:24,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-26 12:03:24,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:24,523 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, 1, 1, 1, 1] [2023-11-26 12:03:24,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-26 12:03:24,523 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-26 12:03:24,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1085025423, now seen corresponding path program 3 times [2023-11-26 12:03:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:24,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018178091] [2023-11-26 12:03:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:24,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:24,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:24,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:03:24,790 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2023-11-26 12:03:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-11-26 12:03:24,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-11-26 12:03:24,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-11-26 12:03:24,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-11-26 12:03:24,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-11-26 12:03:24,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-11-26 12:03:24,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-11-26 12:03:24,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-11-26 12:03:24,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-11-26 12:03:24,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-11-26 12:03:24,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-11-26 12:03:24,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-11-26 12:03:24,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-11-26 12:03:24,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-11-26 12:03:24,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-11-26 12:03:24,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-11-26 12:03:24,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (41 of 59 remaining) [2023-11-26 12:03:24,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-11-26 12:03:24,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-11-26 12:03:24,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-11-26 12:03:24,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-11-26 12:03:24,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-11-26 12:03:24,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-11-26 12:03:24,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-11-26 12:03:24,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-11-26 12:03:24,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-11-26 12:03:24,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-11-26 12:03:24,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-11-26 12:03:24,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-11-26 12:03:24,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-11-26 12:03:24,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-11-26 12:03:24,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-11-26 12:03:24,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-11-26 12:03:24,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (24 of 59 remaining) [2023-11-26 12:03:24,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-11-26 12:03:24,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-11-26 12:03:24,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 59 remaining) [2023-11-26 12:03:24,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-11-26 12:03:24,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-11-26 12:03:24,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-11-26 12:03:24,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-11-26 12:03:24,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-11-26 12:03:24,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-11-26 12:03:24,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-11-26 12:03:24,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-11-26 12:03:24,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-11-26 12:03:24,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-11-26 12:03:24,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-11-26 12:03:24,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-11-26 12:03:24,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-11-26 12:03:24,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-11-26 12:03:24,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2023-11-26 12:03:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-11-26 12:03:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 59 remaining) [2023-11-26 12:03:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-11-26 12:03:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-11-26 12:03:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-11-26 12:03:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-11-26 12:03:24,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-26 12:03:24,807 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:24,816 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 12:03:24,816 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:03:24,936 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-26 12:03:24,943 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-26 12:03:24,960 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre26 could not be translated [2023-11-26 12:03:24,985 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:03:24,990 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 12:03:25,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:03:25 BasicIcfg [2023-11-26 12:03:25,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:03:25,013 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:03:25,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:03:25,014 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:03:25,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:54" (3/4) ... [2023-11-26 12:03:25,017 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:03:25,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:03:25,019 INFO L158 Benchmark]: Toolchain (without parser) took 33762.16ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 135.2MB in the beginning and 862.1MB in the end (delta: -726.9MB). Peak memory consumption was 226.3MB. Max. memory is 16.1GB. [2023-11-26 12:03:25,020 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:03:25,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.20ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 111.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:25,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.86ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:03:25,021 INFO L158 Benchmark]: Boogie Preprocessor took 120.89ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 104.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:03:25,022 INFO L158 Benchmark]: RCFGBuilder took 1711.86ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 104.1MB in the end (delta: -168.6kB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2023-11-26 12:03:25,022 INFO L158 Benchmark]: TraceAbstraction took 31007.54ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 104.1MB in the beginning and 862.1MB in the end (delta: -758.0MB). Peak memory consumption was 194.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:25,023 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 1.1GB. Free memory is still 862.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:03:25,025 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.20ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 111.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.86ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.89ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 104.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1711.86ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 104.1MB in the end (delta: -168.6kB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31007.54ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 104.1MB in the beginning and 862.1MB in the end (delta: -758.0MB). Peak memory consumption was 194.1MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 1.1GB. Free memory is still 862.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L848] 0 pthread_t t2102; [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={7:0}, t2101={8:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={8:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={8:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={7:0}, t2101={8:0}, t2102={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 123 locations, 59 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.6s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1434 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1227 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3816 IncrementalHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 50 mSDtfsCounter, 3816 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=25, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 461 ConstructedInterpolants, 0 QuantifiedInterpolants, 3673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 12:03:25,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme --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 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:03:27,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:03:27,934 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 12:03:27,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:03:27,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:03:27,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:03:27,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:03:27,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:03:27,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:03:28,000 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:03:28,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:03:28,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:03:28,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:03:28,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:03:28,005 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:03:28,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:03:28,006 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:03:28,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:03:28,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:03:28,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:03:28,007 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 12:03:28,008 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 12:03:28,008 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 12:03:28,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:03:28,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:03:28,009 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 12:03:28,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 12:03:28,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:03:28,011 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:03:28,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:03:28,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:03:28,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:03:28,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:03:28,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:03:28,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:03:28,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:03:28,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:03:28,015 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 12:03:28,015 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 12:03:28,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:03:28,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:03:28,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:03:28,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:03:28,016 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 12:03:28,017 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_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/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_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2023-11-26 12:03:28,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:03:28,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:03:28,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:03:28,431 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:03:28,432 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:03:28,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ffbb068c-9046-4167-9c1a-4927fd5ce1fa/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe014_power.opt.i [2023-11-26 12:03:31,574 INFO L533 CDTParser]: Created temporary CDT project at NULL