./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b3f2e76aa91b47c1b0ab3ebb03a5219efabc6e79eff8c780f49eaa0a2d155ad --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:41:41,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:41:41,580 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:41:41,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:41:41,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:41:41,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:41:41,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:41:41,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:41:41,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:41:41,640 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:41:41,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:41:41,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:41:41,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:41:41,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:41:41,643 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:41:41,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:41:41,644 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:41:41,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:41:41,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:41:41,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:41:41,646 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:41:41,647 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:41:41,648 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:41:41,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:41:41,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:41:41,649 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:41:41,649 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:41:41,650 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:41:41,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:41:41,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:41:41,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:41:41,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:41:41,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:41,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:41:41,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:41:41,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:41:41,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:41:41,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:41:41,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:41:41,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:41:41,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:41:41,665 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_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b3f2e76aa91b47c1b0ab3ebb03a5219efabc6e79eff8c780f49eaa0a2d155ad [2023-11-24 21:41:41,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:41:41,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:41:42,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:41:42,001 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:41:42,002 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:41:42,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2023-11-24 21:41:44,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:41:45,232 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:41:45,233 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2023-11-24 21:41:45,258 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/data/35c7e370f/118cf62b38814b1ab8e178c77770650d/FLAG7902c7063 [2023-11-24 21:41:45,276 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/data/35c7e370f/118cf62b38814b1ab8e178c77770650d [2023-11-24 21:41:45,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:41:45,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:41:45,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:45,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:41:45,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:41:45,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c062514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45, skipping insertion in model container [2023-11-24 21:41:45,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,329 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:41:45,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:45,542 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:41:45,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:45,577 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:45,577 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:45,586 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:41:45,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45 WrapperNode [2023-11-24 21:41:45,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:45,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:45,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:41:45,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:41:45,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,629 INFO L138 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2023-11-24 21:41:45,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:45,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:41:45,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:41:45,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:41:45,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,673 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 21:41:45,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:41:45,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:41:45,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:41:45,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:41:45,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (1/1) ... [2023-11-24 21:41:45,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:45,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:45,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:41:45,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:41:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:41:45,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-24 21:41:45,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-24 21:41:45,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-24 21:41:45,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-24 21:41:45,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-24 21:41:45,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-24 21:41:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:41:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:41:45,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:41:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:41:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:41:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:41:45,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:41:45,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:41:45,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:41:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:41:45,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:41:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:41:45,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-24 21:41:45,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:41:45,830 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:41:46,061 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:41:46,063 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:41:46,410 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:41:46,604 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:41:46,604 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 21:41:46,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:46 BoogieIcfgContainer [2023-11-24 21:41:46,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:41:46,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:41:46,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:41:46,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:41:46,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:41:45" (1/3) ... [2023-11-24 21:41:46,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1435c535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:46, skipping insertion in model container [2023-11-24 21:41:46,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:45" (2/3) ... [2023-11-24 21:41:46,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1435c535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:46, skipping insertion in model container [2023-11-24 21:41:46,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:46" (3/3) ... [2023-11-24 21:41:46,614 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2023-11-24 21:41:46,638 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:41:46,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-24 21:41:46,638 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:41:46,723 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-24 21:41:46,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 61 transitions, 143 flow [2023-11-24 21:41:46,816 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2023-11-24 21:41:46,816 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:41:46,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 4/58 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-24 21:41:46,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 61 transitions, 143 flow [2023-11-24 21:41:46,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 57 transitions, 132 flow [2023-11-24 21:41:46,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:41:46,846 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;@633b1cc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:41:46,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-24 21:41:46,861 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:41:46,862 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:41:46,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:46,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:46,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:46,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:46,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 9144, now seen corresponding path program 1 times [2023-11-24 21:41:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:46,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622792682] [2023-11-24 21:41:46,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:47,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622792682] [2023-11-24 21:41:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622792682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:47,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:47,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:47,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567190596] [2023-11-24 21:41:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:47,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:47,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:47,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-24 21:41:47,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:47,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-24 21:41:47,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:47,602 INFO L124 PetriNetUnfolderBase]: 97/265 cut-off events. [2023-11-24 21:41:47,603 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-24 21:41:47,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 265 events. 97/265 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1340 event pairs, 72 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 379. Up to 154 conditions per place. [2023-11-24 21:41:47,617 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 17 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-24 21:41:47,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 160 flow [2023-11-24 21:41:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-24 21:41:47,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7540983606557377 [2023-11-24 21:41:47,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-24 21:41:47,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-24 21:41:47,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:47,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-24 21:41:47,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,653 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 132 flow. Second operand 3 states and 138 transitions. [2023-11-24 21:41:47,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 160 flow [2023-11-24 21:41:47,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 148 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-24 21:41:47,677 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 114 flow [2023-11-24 21:41:47,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-24 21:41:47,689 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -8 predicate places. [2023-11-24 21:41:47,689 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 114 flow [2023-11-24 21:41:47,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:47,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:47,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:41:47,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:47,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash 9145, now seen corresponding path program 1 times [2023-11-24 21:41:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049546814] [2023-11-24 21:41:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:47,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049546814] [2023-11-24 21:41:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049546814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:47,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654529996] [2023-11-24 21:41:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:47,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:48,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 61 [2023-11-24 21:41:48,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:48,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 61 [2023-11-24 21:41:48,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:48,085 INFO L124 PetriNetUnfolderBase]: 73/228 cut-off events. [2023-11-24 21:41:48,085 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-24 21:41:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 228 events. 73/228 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1135 event pairs, 52 based on Foata normal form. 13/193 useless extension candidates. Maximal degree in co-relation 353. Up to 117 conditions per place. [2023-11-24 21:41:48,089 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 15 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-11-24 21:41:48,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 142 flow [2023-11-24 21:41:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 21:41:48,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7704918032786885 [2023-11-24 21:41:48,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 21:41:48,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 21:41:48,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:48,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 21:41:48,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,102 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-24 21:41:48,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 142 flow [2023-11-24 21:41:48,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:48,108 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 111 flow [2023-11-24 21:41:48,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2023-11-24 21:41:48,114 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-11-24 21:41:48,114 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 111 flow [2023-11-24 21:41:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:48,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:48,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:41:48,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:48,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash 272689716, now seen corresponding path program 1 times [2023-11-24 21:41:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876237081] [2023-11-24 21:41:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:48,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:48,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876237081] [2023-11-24 21:41:48,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876237081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:48,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:48,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026605498] [2023-11-24 21:41:48,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:48,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:48,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:48,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:48,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-24 21:41:48,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:48,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-24 21:41:48,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:48,394 INFO L124 PetriNetUnfolderBase]: 80/228 cut-off events. [2023-11-24 21:41:48,394 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-24 21:41:48,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 228 events. 80/228 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1110 event pairs, 58 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 367. Up to 131 conditions per place. [2023-11-24 21:41:48,398 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 17 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-11-24 21:41:48,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 143 flow [2023-11-24 21:41:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-24 21:41:48,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7486338797814208 [2023-11-24 21:41:48,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-24 21:41:48,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-24 21:41:48,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:48,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-24 21:41:48,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,409 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 111 flow. Second operand 3 states and 137 transitions. [2023-11-24 21:41:48,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 143 flow [2023-11-24 21:41:48,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:48,413 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 108 flow [2023-11-24 21:41:48,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-11-24 21:41:48,415 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2023-11-24 21:41:48,415 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 108 flow [2023-11-24 21:41:48,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:48,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:48,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:41:48,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:48,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 272689717, now seen corresponding path program 1 times [2023-11-24 21:41:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:48,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988102995] [2023-11-24 21:41:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:48,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:48,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988102995] [2023-11-24 21:41:48,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988102995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:48,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:48,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448575502] [2023-11-24 21:41:48,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:48,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:48,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:48,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 61 [2023-11-24 21:41:48,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 108 flow. Second operand has 3 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-24 21:41:48,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:48,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 61 [2023-11-24 21:41:48,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:48,653 INFO L124 PetriNetUnfolderBase]: 73/214 cut-off events. [2023-11-24 21:41:48,653 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-24 21:41:48,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 214 events. 73/214 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1014 event pairs, 52 based on Foata normal form. 7/187 useless extension candidates. Maximal degree in co-relation 339. Up to 117 conditions per place. [2023-11-24 21:41:48,657 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 15 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-11-24 21:41:48,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 136 flow [2023-11-24 21:41:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 21:41:48,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7704918032786885 [2023-11-24 21:41:48,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 21:41:48,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 21:41:48,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:48,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 21:41:48,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,662 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 108 flow. Second operand 3 states and 141 transitions. [2023-11-24 21:41:48,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 136 flow [2023-11-24 21:41:48,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:48,665 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 105 flow [2023-11-24 21:41:48,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-11-24 21:41:48,666 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -11 predicate places. [2023-11-24 21:41:48,666 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 105 flow [2023-11-24 21:41:48,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-24 21:41:48,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:48,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:41:48,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:48,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1916451594, now seen corresponding path program 1 times [2023-11-24 21:41:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:48,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772353043] [2023-11-24 21:41:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772353043] [2023-11-24 21:41:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772353043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:48,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:48,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683195325] [2023-11-24 21:41:48,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:48,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:48,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:48,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:48,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:48,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-24 21:41:48,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:48,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-24 21:41:48,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:48,866 INFO L124 PetriNetUnfolderBase]: 83/216 cut-off events. [2023-11-24 21:41:48,866 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-24 21:41:48,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 216 events. 83/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1018 event pairs, 60 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 359. Up to 135 conditions per place. [2023-11-24 21:41:48,869 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 17 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-11-24 21:41:48,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 137 flow [2023-11-24 21:41:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-24 21:41:48,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7486338797814208 [2023-11-24 21:41:48,871 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-24 21:41:48,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-24 21:41:48,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:48,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-24 21:41:48,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,874 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 105 flow. Second operand 3 states and 137 transitions. [2023-11-24 21:41:48,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 137 flow [2023-11-24 21:41:48,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:48,876 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 102 flow [2023-11-24 21:41:48,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-24 21:41:48,877 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -12 predicate places. [2023-11-24 21:41:48,877 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 102 flow [2023-11-24 21:41:48,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:48,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:48,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:48,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:41:48,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:48,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1916451595, now seen corresponding path program 1 times [2023-11-24 21:41:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323822709] [2023-11-24 21:41:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323822709] [2023-11-24 21:41:49,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323822709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:49,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:49,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:49,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104754760] [2023-11-24 21:41:49,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:49,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:49,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 61 [2023-11-24 21:41:49,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:49,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 61 [2023-11-24 21:41:49,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:49,143 INFO L124 PetriNetUnfolderBase]: 73/198 cut-off events. [2023-11-24 21:41:49,143 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-24 21:41:49,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 198 events. 73/198 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 899 event pairs, 52 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 323. Up to 117 conditions per place. [2023-11-24 21:41:49,146 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 15 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-11-24 21:41:49,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 130 flow [2023-11-24 21:41:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 21:41:49,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7704918032786885 [2023-11-24 21:41:49,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 21:41:49,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 21:41:49,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:49,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 21:41:49,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,150 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,151 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 102 flow. Second operand 3 states and 141 transitions. [2023-11-24 21:41:49,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 130 flow [2023-11-24 21:41:49,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:49,153 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 99 flow [2023-11-24 21:41:49,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-24 21:41:49,154 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -13 predicate places. [2023-11-24 21:41:49,154 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 99 flow [2023-11-24 21:41:49,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:49,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:49,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:41:49,156 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:49,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2138363269, now seen corresponding path program 1 times [2023-11-24 21:41:49,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:49,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984394805] [2023-11-24 21:41:49,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984394805] [2023-11-24 21:41:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984394805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:41:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230783796] [2023-11-24 21:41:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:49,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-24 21:41:49,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:49,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-24 21:41:49,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:49,431 INFO L124 PetriNetUnfolderBase]: 122/246 cut-off events. [2023-11-24 21:41:49,431 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:41:49,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 246 events. 122/246 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 871 event pairs, 14 based on Foata normal form. 10/246 useless extension candidates. Maximal degree in co-relation 445. Up to 114 conditions per place. [2023-11-24 21:41:49,435 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 28 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-11-24 21:41:49,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 191 flow [2023-11-24 21:41:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2023-11-24 21:41:49,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7909836065573771 [2023-11-24 21:41:49,437 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 193 transitions. [2023-11-24 21:41:49,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 193 transitions. [2023-11-24 21:41:49,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:49,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 193 transitions. [2023-11-24 21:41:49,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,440 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,440 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 99 flow. Second operand 4 states and 193 transitions. [2023-11-24 21:41:49,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 191 flow [2023-11-24 21:41:49,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:49,443 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 119 flow [2023-11-24 21:41:49,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-24 21:41:49,444 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2023-11-24 21:41:49,444 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 119 flow [2023-11-24 21:41:49,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:49,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:49,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:41:49,445 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:49,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -892580371, now seen corresponding path program 2 times [2023-11-24 21:41:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875762501] [2023-11-24 21:41:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:49,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:49,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875762501] [2023-11-24 21:41:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875762501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:49,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:49,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517943960] [2023-11-24 21:41:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:49,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:49,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:49,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-24 21:41:49,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:49,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-24 21:41:49,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:49,782 INFO L124 PetriNetUnfolderBase]: 236/433 cut-off events. [2023-11-24 21:41:49,782 INFO L125 PetriNetUnfolderBase]: For 38/50 co-relation queries the response was YES. [2023-11-24 21:41:49,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 433 events. 236/433 cut-off events. For 38/50 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1775 event pairs, 45 based on Foata normal form. 12/405 useless extension candidates. Maximal degree in co-relation 848. Up to 159 conditions per place. [2023-11-24 21:41:49,788 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 33 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2023-11-24 21:41:49,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 251 flow [2023-11-24 21:41:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:41:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:41:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2023-11-24 21:41:49,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7737704918032787 [2023-11-24 21:41:49,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 236 transitions. [2023-11-24 21:41:49,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 236 transitions. [2023-11-24 21:41:49,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:49,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 236 transitions. [2023-11-24 21:41:49,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.2) internal successors, (236), 5 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-24 21:41:49,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,793 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,793 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 119 flow. Second operand 5 states and 236 transitions. [2023-11-24 21:41:49,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 251 flow [2023-11-24 21:41:49,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:49,796 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 172 flow [2023-11-24 21:41:49,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-24 21:41:49,797 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2023-11-24 21:41:49,797 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 172 flow [2023-11-24 21:41:49,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:49,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:49,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:49,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:41:49,799 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:49,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1324022851, now seen corresponding path program 3 times [2023-11-24 21:41:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715105059] [2023-11-24 21:41:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:50,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715105059] [2023-11-24 21:41:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715105059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:50,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418451807] [2023-11-24 21:41:50,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:50,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:50,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:50,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:50,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:50,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 61 [2023-11-24 21:41:50,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:50,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 61 [2023-11-24 21:41:50,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:50,444 INFO L124 PetriNetUnfolderBase]: 633/1280 cut-off events. [2023-11-24 21:41:50,444 INFO L125 PetriNetUnfolderBase]: For 748/808 co-relation queries the response was YES. [2023-11-24 21:41:50,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1280 events. 633/1280 cut-off events. For 748/808 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7650 event pairs, 61 based on Foata normal form. 54/1231 useless extension candidates. Maximal degree in co-relation 2736. Up to 390 conditions per place. [2023-11-24 21:41:50,457 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 49 selfloop transitions, 15 changer transitions 8/97 dead transitions. [2023-11-24 21:41:50,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 97 transitions, 468 flow [2023-11-24 21:41:50,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:41:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:41:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2023-11-24 21:41:50,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7962529274004684 [2023-11-24 21:41:50,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 340 transitions. [2023-11-24 21:41:50,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 340 transitions. [2023-11-24 21:41:50,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:50,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 340 transitions. [2023-11-24 21:41:50,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,463 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 61.0) internal successors, (488), 8 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,463 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 172 flow. Second operand 7 states and 340 transitions. [2023-11-24 21:41:50,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 97 transitions, 468 flow [2023-11-24 21:41:50,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:41:50,469 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 313 flow [2023-11-24 21:41:50,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2023-11-24 21:41:50,471 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2023-11-24 21:41:50,471 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 313 flow [2023-11-24 21:41:50,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:50,471 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, 1] [2023-11-24 21:41:50,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:41:50,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:50,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1287380403, now seen corresponding path program 1 times [2023-11-24 21:41:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:50,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080585384] [2023-11-24 21:41:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:50,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080585384] [2023-11-24 21:41:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080585384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:50,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:50,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532682483] [2023-11-24 21:41:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:50,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:50,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-24 21:41:50,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:50,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-24 21:41:50,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:50,812 INFO L124 PetriNetUnfolderBase]: 593/1299 cut-off events. [2023-11-24 21:41:50,812 INFO L125 PetriNetUnfolderBase]: For 1849/2177 co-relation queries the response was YES. [2023-11-24 21:41:50,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 1299 events. 593/1299 cut-off events. For 1849/2177 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8062 event pairs, 186 based on Foata normal form. 110/1252 useless extension candidates. Maximal degree in co-relation 3157. Up to 538 conditions per place. [2023-11-24 21:41:50,830 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 33 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-11-24 21:41:50,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 428 flow [2023-11-24 21:41:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-24 21:41:50,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2023-11-24 21:41:50,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-24 21:41:50,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-24 21:41:50,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:50,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-24 21:41:50,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,834 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 313 flow. Second operand 3 states and 154 transitions. [2023-11-24 21:41:50,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 428 flow [2023-11-24 21:41:50,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 424 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-24 21:41:50,843 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 331 flow [2023-11-24 21:41:50,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2023-11-24 21:41:50,844 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 13 predicate places. [2023-11-24 21:41:50,844 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 331 flow [2023-11-24 21:41:50,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:50,845 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, 1] [2023-11-24 21:41:50,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:41:50,845 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:50,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash 872694921, now seen corresponding path program 1 times [2023-11-24 21:41:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603033738] [2023-11-24 21:41:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:50,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603033738] [2023-11-24 21:41:50,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603033738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:50,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:50,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:50,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451463711] [2023-11-24 21:41:50,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:50,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:50,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:50,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-24 21:41:50,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:50,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-24 21:41:50,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:51,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][67], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 48#L54true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 4#L111-4true, 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:51,336 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:41:51,337 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:51,337 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:51,337 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:51,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][67], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 46#L112true, 48#L54true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:51,368 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:41:51,369 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:41:51,369 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:41:51,369 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:41:51,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([292] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][52], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:51,405 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-24 21:41:51,405 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-24 21:41:51,406 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-24 21:41:51,406 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-24 21:41:51,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([292] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][52], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 138#true, 46#L112true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 132#true, Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 28#L76true, 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:51,423 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-24 21:41:51,424 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:41:51,424 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:41:51,424 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:41:51,472 INFO L124 PetriNetUnfolderBase]: 1604/3035 cut-off events. [2023-11-24 21:41:51,473 INFO L125 PetriNetUnfolderBase]: For 3206/3272 co-relation queries the response was YES. [2023-11-24 21:41:51,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7668 conditions, 3035 events. 1604/3035 cut-off events. For 3206/3272 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 20627 event pairs, 482 based on Foata normal form. 61/2753 useless extension candidates. Maximal degree in co-relation 7638. Up to 1320 conditions per place. [2023-11-24 21:41:51,508 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 36 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2023-11-24 21:41:51,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 82 transitions, 474 flow [2023-11-24 21:41:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-24 21:41:51,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2023-11-24 21:41:51,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-24 21:41:51,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-24 21:41:51,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:51,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-24 21:41:51,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,512 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 331 flow. Second operand 3 states and 154 transitions. [2023-11-24 21:41:51,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 82 transitions, 474 flow [2023-11-24 21:41:51,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:51,536 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 347 flow [2023-11-24 21:41:51,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2023-11-24 21:41:51,537 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2023-11-24 21:41:51,538 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 347 flow [2023-11-24 21:41:51,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:51,538 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-24 21:41:51,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:41:51,539 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:51,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1197222765, now seen corresponding path program 1 times [2023-11-24 21:41:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:51,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582716154] [2023-11-24 21:41:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582716154] [2023-11-24 21:41:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582716154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321479083] [2023-11-24 21:41:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:51,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:41:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:51,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:41:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:41:51,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 61 [2023-11-24 21:41:51,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:51,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 61 [2023-11-24 21:41:51,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:52,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,697 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:41:52,697 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:41:52,698 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:41:52,698 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:41:52,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), 42#thread1EXITtrue, Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 46#L112true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, 115#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,758 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,758 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,758 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,758 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 42#thread1EXITtrue, Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,763 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,763 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,763 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,764 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:41:52,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), 42#thread1EXITtrue, Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 46#L112true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,809 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:41:52,809 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:41:52,810 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:41:52,810 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:41:52,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 132#true, 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 48#L54true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, 4#L111-4true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,833 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:41:52,833 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:41:52,834 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:41:52,834 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:41:52,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 54#L112-2true, Black: 138#true, 58#L92true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,848 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:41:52,848 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:41:52,848 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:41:52,848 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:41:52,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 132#true, 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 138#true, 46#L112true, 48#L54true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,867 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:41:52,867 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:41:52,867 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:41:52,867 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:41:52,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([305] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][96], [Black: 117#(<= 0 ~pos~0), Black: 118#(= ~v_assert~0 1), Black: 121#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 125#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0)), 88#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 107#(< (* 256 (div thread2Thread1of1ForFork0_~lv_assert~1 256)) thread2Thread1of1ForFork0_~lv_assert~1), Black: 134#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 84#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 54#L112-2true, Black: 138#true, 92#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 72#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 99#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 96#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 80#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 52#thread3EXITtrue, Black: 103#true, Black: 109#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) thread2Thread1of1ForFork0_~lv_assert~1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) (div ~v_assert~0 256)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 115#true, Black: 105#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), 140#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 76#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 11#L78true, 144#true, Black: 123#(and (<= 1 thread2Thread1of1ForFork0_~lv_assert~1) (= ~v_assert~0 1) (<= (div thread2Thread1of1ForFork0_~lv_assert~1 256) 0) (<= 0 ~pos~0))]) [2023-11-24 21:41:52,881 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:41:52,881 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:41:52,881 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:41:52,881 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:41:52,929 INFO L124 PetriNetUnfolderBase]: 2873/5534 cut-off events. [2023-11-24 21:41:52,929 INFO L125 PetriNetUnfolderBase]: For 8815/8967 co-relation queries the response was YES. [2023-11-24 21:41:52,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15575 conditions, 5534 events. 2873/5534 cut-off events. For 8815/8967 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 41702 event pairs, 231 based on Foata normal form. 116/5391 useless extension candidates. Maximal degree in co-relation 15543. Up to 926 conditions per place. [2023-11-24 21:41:52,979 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 40 selfloop transitions, 9 changer transitions 81/158 dead transitions. [2023-11-24 21:41:52,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 158 transitions, 1069 flow [2023-11-24 21:41:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:41:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:41:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 485 transitions. [2023-11-24 21:41:52,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7950819672131147 [2023-11-24 21:41:52,983 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 485 transitions. [2023-11-24 21:41:52,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 485 transitions. [2023-11-24 21:41:52,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:52,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 485 transitions. [2023-11-24 21:41:52,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 61.0) internal successors, (671), 11 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,990 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 61.0) internal successors, (671), 11 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,990 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 347 flow. Second operand 10 states and 485 transitions. [2023-11-24 21:41:52,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 158 transitions, 1069 flow [2023-11-24 21:41:53,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 158 transitions, 1063 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:53,042 INFO L231 Difference]: Finished difference. Result has 93 places, 61 transitions, 346 flow [2023-11-24 21:41:53,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=346, PETRI_PLACES=93, PETRI_TRANSITIONS=61} [2023-11-24 21:41:53,045 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 30 predicate places. [2023-11-24 21:41:53,045 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 61 transitions, 346 flow [2023-11-24 21:41:53,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:53,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:53,046 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-24 21:41:53,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:41:53,047 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:53,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 868288415, now seen corresponding path program 1 times [2023-11-24 21:41:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350947772] [2023-11-24 21:41:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350947772] [2023-11-24 21:41:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350947772] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410438914] [2023-11-24 21:41:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:53,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:53,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:53,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:53,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:41:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:41:53,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 21:41:53,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:41:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410438914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:53,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 21:41:53,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-24 21:41:53,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676920457] [2023-11-24 21:41:53,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:53,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:53,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:41:53,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-24 21:41:53,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 61 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:53,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:53,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-24 21:41:53,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:54,103 INFO L124 PetriNetUnfolderBase]: 760/1643 cut-off events. [2023-11-24 21:41:54,104 INFO L125 PetriNetUnfolderBase]: For 7609/7885 co-relation queries the response was YES. [2023-11-24 21:41:54,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1643 events. 760/1643 cut-off events. For 7609/7885 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10493 event pairs, 155 based on Foata normal form. 96/1564 useless extension candidates. Maximal degree in co-relation 5839. Up to 507 conditions per place. [2023-11-24 21:41:54,131 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 35 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2023-11-24 21:41:54,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 502 flow [2023-11-24 21:41:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:41:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:41:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2023-11-24 21:41:54,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7770491803278688 [2023-11-24 21:41:54,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 237 transitions. [2023-11-24 21:41:54,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 237 transitions. [2023-11-24 21:41:54,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:54,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 237 transitions. [2023-11-24 21:41:54,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,136 INFO L175 Difference]: Start difference. First operand has 93 places, 61 transitions, 346 flow. Second operand 5 states and 237 transitions. [2023-11-24 21:41:54,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 502 flow [2023-11-24 21:41:54,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 464 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-11-24 21:41:54,154 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 335 flow [2023-11-24 21:41:54,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2023-11-24 21:41:54,156 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2023-11-24 21:41:54,156 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 335 flow [2023-11-24 21:41:54,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:54,157 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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-24 21:41:54,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:54,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 21:41:54,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:54,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 459086853, now seen corresponding path program 2 times [2023-11-24 21:41:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:54,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830066413] [2023-11-24 21:41:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830066413] [2023-11-24 21:41:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830066413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284476736] [2023-11-24 21:41:54,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:41:54,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:54,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:54,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:54,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:41:54,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:41:54,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:41:54,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 21:41:54,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:41:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:54,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:41:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284476736] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:41:54,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:41:54,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 9 [2023-11-24 21:41:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041032926] [2023-11-24 21:41:54,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:41:54,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:41:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:41:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:41:54,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-24 21:41:54,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 335 flow. Second operand has 10 states, 10 states have (on average 40.4) internal successors, (404), 10 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:54,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-24 21:41:54,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:56,660 INFO L124 PetriNetUnfolderBase]: 3475/6533 cut-off events. [2023-11-24 21:41:56,660 INFO L125 PetriNetUnfolderBase]: For 21606/22162 co-relation queries the response was YES. [2023-11-24 21:41:56,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23218 conditions, 6533 events. 3475/6533 cut-off events. For 21606/22162 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 49115 event pairs, 321 based on Foata normal form. 220/6108 useless extension candidates. Maximal degree in co-relation 23181. Up to 1367 conditions per place. [2023-11-24 21:41:56,758 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 78 selfloop transitions, 30 changer transitions 59/194 dead transitions. [2023-11-24 21:41:56,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1479 flow [2023-11-24 21:41:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-24 21:41:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-24 21:41:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 739 transitions. [2023-11-24 21:41:56,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.757172131147541 [2023-11-24 21:41:56,764 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 739 transitions. [2023-11-24 21:41:56,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 739 transitions. [2023-11-24 21:41:56,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:56,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 739 transitions. [2023-11-24 21:41:56,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 46.1875) internal successors, (739), 16 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:56,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:56,777 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:56,777 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 335 flow. Second operand 16 states and 739 transitions. [2023-11-24 21:41:56,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1479 flow [2023-11-24 21:41:56,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 194 transitions, 1464 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:41:56,801 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 646 flow [2023-11-24 21:41:56,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=646, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2023-11-24 21:41:56,803 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 40 predicate places. [2023-11-24 21:41:56,803 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 646 flow [2023-11-24 21:41:56,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.4) internal successors, (404), 10 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:56,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:56,804 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 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-24 21:41:56,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:41:57,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-24 21:41:57,018 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:57,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1127068667, now seen corresponding path program 2 times [2023-11-24 21:41:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326165276] [2023-11-24 21:41:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:41:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326165276] [2023-11-24 21:41:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326165276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774775283] [2023-11-24 21:41:57,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:57,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:57,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-24 21:41:57,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 646 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:57,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:57,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-24 21:41:57,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:58,156 INFO L124 PetriNetUnfolderBase]: 1508/3357 cut-off events. [2023-11-24 21:41:58,157 INFO L125 PetriNetUnfolderBase]: For 18204/18686 co-relation queries the response was YES. [2023-11-24 21:41:58,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12677 conditions, 3357 events. 1508/3357 cut-off events. For 18204/18686 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 24849 event pairs, 405 based on Foata normal form. 161/3078 useless extension candidates. Maximal degree in co-relation 12631. Up to 722 conditions per place. [2023-11-24 21:41:58,206 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 57 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2023-11-24 21:41:58,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 107 transitions, 835 flow [2023-11-24 21:41:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2023-11-24 21:41:58,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.860655737704918 [2023-11-24 21:41:58,208 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 210 transitions. [2023-11-24 21:41:58,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 210 transitions. [2023-11-24 21:41:58,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:58,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 210 transitions. [2023-11-24 21:41:58,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,211 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 646 flow. Second operand 4 states and 210 transitions. [2023-11-24 21:41:58,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 107 transitions, 835 flow [2023-11-24 21:41:58,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 107 transitions, 768 flow, removed 19 selfloop flow, removed 9 redundant places. [2023-11-24 21:41:58,250 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 570 flow [2023-11-24 21:41:58,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=570, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2023-11-24 21:41:58,253 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 33 predicate places. [2023-11-24 21:41:58,253 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 570 flow [2023-11-24 21:41:58,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:58,254 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 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-24 21:41:58,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:41:58,255 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:58,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 651545345, now seen corresponding path program 3 times [2023-11-24 21:41:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644403786] [2023-11-24 21:41:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:41:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644403786] [2023-11-24 21:41:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644403786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:58,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:58,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:58,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059916251] [2023-11-24 21:41:58,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:58,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:58,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:58,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:58,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-11-24 21:41:58,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 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-24 21:41:58,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:58,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-11-24 21:41:58,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:59,379 INFO L124 PetriNetUnfolderBase]: 1895/3981 cut-off events. [2023-11-24 21:41:59,379 INFO L125 PetriNetUnfolderBase]: For 17340/17620 co-relation queries the response was YES. [2023-11-24 21:41:59,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14839 conditions, 3981 events. 1895/3981 cut-off events. For 17340/17620 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29966 event pairs, 508 based on Foata normal form. 66/3640 useless extension candidates. Maximal degree in co-relation 14797. Up to 1148 conditions per place. [2023-11-24 21:41:59,444 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 55 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2023-11-24 21:41:59,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 105 transitions, 839 flow [2023-11-24 21:41:59,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2023-11-24 21:41:59,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8278688524590164 [2023-11-24 21:41:59,446 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 202 transitions. [2023-11-24 21:41:59,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 202 transitions. [2023-11-24 21:41:59,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:59,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 202 transitions. [2023-11-24 21:41:59,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 50.5) internal successors, (202), 4 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-24 21:41:59,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:59,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:59,451 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 570 flow. Second operand 4 states and 202 transitions. [2023-11-24 21:41:59,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 105 transitions, 839 flow [2023-11-24 21:41:59,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 105 transitions, 825 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-24 21:41:59,485 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 574 flow [2023-11-24 21:41:59,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=574, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-11-24 21:41:59,487 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2023-11-24 21:41:59,487 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 574 flow [2023-11-24 21:41:59,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 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-24 21:41:59,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:59,488 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-11-24 21:41:59,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:41:59,488 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:41:59,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2060945037, now seen corresponding path program 1 times [2023-11-24 21:41:59,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:59,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064914846] [2023-11-24 21:41:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:59,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064914846] [2023-11-24 21:41:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064914846] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:41:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935133903] [2023-11-24 21:41:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:59,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:41:59,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:59,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:41:59,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:41:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:59,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:41:59,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:42:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:00,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:42:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935133903] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:42:00,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:42:00,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2023-11-24 21:42:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850343399] [2023-11-24 21:42:00,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:42:00,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:42:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:00,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:42:00,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:42:00,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 61 [2023-11-24 21:42:00,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 574 flow. Second operand has 11 states, 11 states have (on average 40.09090909090909) internal successors, (441), 11 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:00,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:00,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 61 [2023-11-24 21:42:00,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:02,676 INFO L124 PetriNetUnfolderBase]: 4366/8909 cut-off events. [2023-11-24 21:42:02,676 INFO L125 PetriNetUnfolderBase]: For 53218/53729 co-relation queries the response was YES. [2023-11-24 21:42:02,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37953 conditions, 8909 events. 4366/8909 cut-off events. For 53218/53729 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 69514 event pairs, 272 based on Foata normal form. 427/8868 useless extension candidates. Maximal degree in co-relation 37911. Up to 1807 conditions per place. [2023-11-24 21:42:02,981 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 73 selfloop transitions, 54 changer transitions 71/232 dead transitions. [2023-11-24 21:42:02,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 232 transitions, 2108 flow [2023-11-24 21:42:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-24 21:42:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-24 21:42:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 869 transitions. [2023-11-24 21:42:02,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7497842968075927 [2023-11-24 21:42:02,986 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 869 transitions. [2023-11-24 21:42:02,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 869 transitions. [2023-11-24 21:42:02,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:02,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 869 transitions. [2023-11-24 21:42:02,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 45.73684210526316) internal successors, (869), 19 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:02,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 61.0) internal successors, (1220), 20 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:03,002 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 61.0) internal successors, (1220), 20 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:03,003 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 574 flow. Second operand 19 states and 869 transitions. [2023-11-24 21:42:03,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 232 transitions, 2108 flow [2023-11-24 21:42:03,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 232 transitions, 2108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:42:03,209 INFO L231 Difference]: Finished difference. Result has 129 places, 109 transitions, 1120 flow [2023-11-24 21:42:03,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1120, PETRI_PLACES=129, PETRI_TRANSITIONS=109} [2023-11-24 21:42:03,210 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 66 predicate places. [2023-11-24 21:42:03,210 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 1120 flow [2023-11-24 21:42:03,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 40.09090909090909) internal successors, (441), 11 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:03,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:03,211 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-11-24 21:42:03,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:42:03,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-24 21:42:03,417 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:42:03,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash 208710139, now seen corresponding path program 2 times [2023-11-24 21:42:03,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:03,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135339138] [2023-11-24 21:42:03,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135339138] [2023-11-24 21:42:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135339138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:42:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066095517] [2023-11-24 21:42:03,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:42:03,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:42:03,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:42:03,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:42:03,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 21:42:03,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:42:03,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:42:03,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:42:03,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:42:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:03,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:42:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066095517] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:42:04,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:42:04,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2023-11-24 21:42:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601645774] [2023-11-24 21:42:04,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:42:04,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:42:04,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:42:04,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:42:04,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-24 21:42:04,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 109 transitions, 1120 flow. Second operand has 11 states, 11 states have (on average 39.36363636363637) internal successors, (433), 11 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:04,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:04,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-24 21:42:04,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:08,303 INFO L124 PetriNetUnfolderBase]: 6551/13268 cut-off events. [2023-11-24 21:42:08,303 INFO L125 PetriNetUnfolderBase]: For 148716/148903 co-relation queries the response was YES. [2023-11-24 21:42:08,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66906 conditions, 13268 events. 6551/13268 cut-off events. For 148716/148903 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 110784 event pairs, 657 based on Foata normal form. 378/13636 useless extension candidates. Maximal degree in co-relation 66850. Up to 2014 conditions per place. [2023-11-24 21:42:08,484 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 85 changer transitions 125/354 dead transitions. [2023-11-24 21:42:08,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 354 transitions, 4640 flow [2023-11-24 21:42:08,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-24 21:42:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-24 21:42:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1235 transitions. [2023-11-24 21:42:08,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7230679156908665 [2023-11-24 21:42:08,490 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1235 transitions. [2023-11-24 21:42:08,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1235 transitions. [2023-11-24 21:42:08,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:08,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1235 transitions. [2023-11-24 21:42:08,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 44.107142857142854) internal successors, (1235), 28 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,504 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,504 INFO L175 Difference]: Start difference. First operand has 129 places, 109 transitions, 1120 flow. Second operand 28 states and 1235 transitions. [2023-11-24 21:42:08,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 354 transitions, 4640 flow [2023-11-24 21:42:09,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 354 transitions, 4191 flow, removed 214 selfloop flow, removed 8 redundant places. [2023-11-24 21:42:09,280 INFO L231 Difference]: Finished difference. Result has 162 places, 161 transitions, 2202 flow [2023-11-24 21:42:09,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2202, PETRI_PLACES=162, PETRI_TRANSITIONS=161} [2023-11-24 21:42:09,282 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 99 predicate places. [2023-11-24 21:42:09,282 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 161 transitions, 2202 flow [2023-11-24 21:42:09,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 39.36363636363637) internal successors, (433), 11 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:09,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:09,283 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-11-24 21:42:09,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-24 21:42:09,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-24 21:42:09,489 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:42:09,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:09,490 INFO L85 PathProgramCache]: Analyzing trace with hash 939413157, now seen corresponding path program 3 times [2023-11-24 21:42:09,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:09,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011115150] [2023-11-24 21:42:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:09,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011115150] [2023-11-24 21:42:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011115150] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:42:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927057815] [2023-11-24 21:42:09,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:42:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:42:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:42:09,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:42:09,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 21:42:10,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-24 21:42:10,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:42:10,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:42:10,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:42:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:10,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:42:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:10,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927057815] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:42:10,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:42:10,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 11 [2023-11-24 21:42:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852538156] [2023-11-24 21:42:10,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:42:10,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 21:42:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 21:42:10,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:42:10,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-24 21:42:10,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 161 transitions, 2202 flow. Second operand has 12 states, 12 states have (on average 38.916666666666664) internal successors, (467), 12 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:10,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:10,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-24 21:42:10,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:14,286 INFO L124 PetriNetUnfolderBase]: 5269/11106 cut-off events. [2023-11-24 21:42:14,286 INFO L125 PetriNetUnfolderBase]: For 201721/201860 co-relation queries the response was YES. [2023-11-24 21:42:14,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60517 conditions, 11106 events. 5269/11106 cut-off events. For 201721/201860 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 95282 event pairs, 399 based on Foata normal form. 170/11270 useless extension candidates. Maximal degree in co-relation 60462. Up to 2662 conditions per place. [2023-11-24 21:42:14,369 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2023-11-24 21:42:14,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 354 transitions, 5752 flow [2023-11-24 21:42:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-24 21:42:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-24 21:42:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1206 transitions. [2023-11-24 21:42:14,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7060889929742389 [2023-11-24 21:42:14,377 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1206 transitions. [2023-11-24 21:42:14,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1206 transitions. [2023-11-24 21:42:14,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:14,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1206 transitions. [2023-11-24 21:42:14,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 43.07142857142857) internal successors, (1206), 28 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:14,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:14,387 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 61.0) internal successors, (1769), 29 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:14,387 INFO L175 Difference]: Start difference. First operand has 162 places, 161 transitions, 2202 flow. Second operand 28 states and 1206 transitions. [2023-11-24 21:42:14,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 354 transitions, 5752 flow [2023-11-24 21:42:14,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 354 transitions, 4672 flow, removed 494 selfloop flow, removed 20 redundant places. [2023-11-24 21:42:14,814 INFO L231 Difference]: Finished difference. Result has 144 places, 0 transitions, 0 flow [2023-11-24 21:42:14,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=0, PETRI_PLACES=144, PETRI_TRANSITIONS=0} [2023-11-24 21:42:14,815 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 81 predicate places. [2023-11-24 21:42:14,815 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 0 transitions, 0 flow [2023-11-24 21:42:14,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.916666666666664) internal successors, (467), 12 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:14,818 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2023-11-24 21:42:14,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2023-11-24 21:42:14,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2023-11-24 21:42:14,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2023-11-24 21:42:14,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2023-11-24 21:42:14,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2023-11-24 21:42:14,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2023-11-24 21:42:14,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2023-11-24 21:42:14,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2023-11-24 21:42:14,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2023-11-24 21:42:14,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2023-11-24 21:42:14,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2023-11-24 21:42:14,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (4 of 17 remaining) [2023-11-24 21:42:14,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (3 of 17 remaining) [2023-11-24 21:42:14,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 17 remaining) [2023-11-24 21:42:14,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 17 remaining) [2023-11-24 21:42:14,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 17 remaining) [2023-11-24 21:42:14,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-24 21:42:15,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:42:15,029 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:15,033 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:42:15,033 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:42:15,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:42:15 BasicIcfg [2023-11-24 21:42:15,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:42:15,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:42:15,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:42:15,040 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:42:15,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:46" (3/4) ... [2023-11-24 21:42:15,043 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-24 21:42:15,047 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-24 21:42:15,048 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-24 21:42:15,048 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-24 21:42:15,059 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2023-11-24 21:42:15,060 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-24 21:42:15,060 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-24 21:42:15,060 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-24 21:42:15,190 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/witness.graphml [2023-11-24 21:42:15,190 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/witness.yml [2023-11-24 21:42:15,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:42:15,191 INFO L158 Benchmark]: Toolchain (without parser) took 29904.94ms. Allocated memory was 176.2MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 144.9MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 633.9MB. Max. memory is 16.1GB. [2023-11-24 21:42:15,192 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 127.9MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:42:15,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.07ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 133.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-24 21:42:15,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.96ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 132.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:42:15,194 INFO L158 Benchmark]: Boogie Preprocessor took 79.93ms. Allocated memory is still 176.2MB. Free memory was 132.0MB in the beginning and 129.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:42:15,194 INFO L158 Benchmark]: RCFGBuilder took 888.09ms. Allocated memory is still 176.2MB. Free memory was 129.1MB in the beginning and 118.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-24 21:42:15,195 INFO L158 Benchmark]: TraceAbstraction took 28431.11ms. Allocated memory was 176.2MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 118.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 709.9MB. Max. memory is 16.1GB. [2023-11-24 21:42:15,195 INFO L158 Benchmark]: Witness Printer took 151.24ms. Allocated memory is still 5.6GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:42:15,198 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.28ms. Allocated memory is still 127.9MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.07ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 133.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.96ms. Allocated memory is still 176.2MB. Free memory was 133.3MB in the beginning and 132.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.93ms. Allocated memory is still 176.2MB. Free memory was 132.0MB in the beginning and 129.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 888.09ms. Allocated memory is still 176.2MB. Free memory was 129.1MB in the beginning and 118.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28431.11ms. Allocated memory was 176.2MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 118.3MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 709.9MB. Max. memory is 16.1GB. * Witness Printer took 151.24ms. Allocated memory is still 5.6GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 97]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 83 locations, 17 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: 28.3s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1336 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1119 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3455 IncrementalHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 69 mSDtfsCounter, 3455 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 391 SyntacticMatches, 18 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2202occurred in iteration=18, InterpolantAutomatonStates: 154, 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.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 762 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 2682 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1106 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 102/178 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-24 21:42:15,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b761816-198f-4240-880b-6a8ee7f325ae/bin/uautomizer-verify-NlZe1sFDwI/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 Writing output log to file Ultimate.log Result: TRUE