./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya --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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:42:20,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:42:20,957 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:42:20,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:42:20,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:42:20,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:42:20,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:42:20,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:42:20,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:42:20,988 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:42:20,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:42:20,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:42:20,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:42:20,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:42:20,991 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:42:20,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:42:20,992 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:42:20,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:42:20,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:42:20,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:42:20,994 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:42:20,994 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:42:20,995 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:42:20,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:42:20,995 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:42:20,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:42:20,996 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:42:20,997 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:42:20,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:42:20,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:42:20,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:42:20,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:42:20,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:20,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:42:20,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:42:20,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:42:20,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:42:20,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:42:21,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:42:21,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:42:21,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:42:21,000 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_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/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_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2023-11-29 06:42:21,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:42:21,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:42:21,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:42:21,242 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:42:21,242 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:42:21,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-29 06:42:24,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:42:24,301 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:42:24,301 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-29 06:42:24,317 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data/6537e2e94/2914f66683784a9c8d3c4a8354aa0b26/FLAG762f8d464 [2023-11-29 06:42:24,330 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data/6537e2e94/2914f66683784a9c8d3c4a8354aa0b26 [2023-11-29 06:42:24,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:42:24,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:42:24,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:24,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:42:24,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:42:24,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207214f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24, skipping insertion in model container [2023-11-29 06:42:24,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,389 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:42:24,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:24,680 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:42:24,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:24,746 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:42:24,746 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:42:24,752 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:42:24,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24 WrapperNode [2023-11-29 06:42:24,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:24,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:24,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:42:24,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:42:24,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,798 INFO L138 Inliner]: procedures = 173, calls = 51, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2023-11-29 06:42:24,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:24,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:42:24,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:42:24,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:42:24,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,829 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 06:42:24,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:42:24,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:42:24,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:42:24,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:42:24,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (1/1) ... [2023-11-29 06:42:24,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:24,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:42:24,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:42:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:42:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:42:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:42:24,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:42:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 06:42:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:42:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:42:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:42:24,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:42:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 06:42:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:42:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:42:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-29 06:42:24,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-29 06:42:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:42:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:42:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:42:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:42:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:42:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:42:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 06:42:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:42:24,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:42:24,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:42:24,911 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-29 06:42:24,911 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-29 06:42:24,913 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 06:42:25,050 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:42:25,052 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:42:25,258 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:42:25,369 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:42:25,370 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:42:25,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:25 BoogieIcfgContainer [2023-11-29 06:42:25,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:42:25,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:42:25,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:42:25,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:42:25,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:42:24" (1/3) ... [2023-11-29 06:42:25,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606d5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:25, skipping insertion in model container [2023-11-29 06:42:25,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:24" (2/3) ... [2023-11-29 06:42:25,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606d5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:25, skipping insertion in model container [2023-11-29 06:42:25,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:25" (3/3) ... [2023-11-29 06:42:25,390 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-11-29 06:42:25,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:42:25,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-29 06:42:25,411 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:42:25,475 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 06:42:25,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 89 transitions, 206 flow [2023-11-29 06:42:25,551 INFO L124 PetriNetUnfolderBase]: 4/85 cut-off events. [2023-11-29 06:42:25,551 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 06:42:25,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 85 events. 4/85 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-11-29 06:42:25,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 89 transitions, 206 flow [2023-11-29 06:42:25,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 84 transitions, 192 flow [2023-11-29 06:42:25,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:42:25,578 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;@362d92fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:42:25,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-29 06:42:25,581 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:42:25,582 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 06:42:25,582 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:42:25,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:25,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:42:25,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:25,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash 8626, now seen corresponding path program 1 times [2023-11-29 06:42:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:25,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501937401] [2023-11-29 06:42:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:25,949 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-29 06:42:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501937401] [2023-11-29 06:42:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501937401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:25,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:25,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789217745] [2023-11-29 06:42:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:25,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:25,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:26,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:42:26,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:26,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:26,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:42:26,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:26,682 INFO L124 PetriNetUnfolderBase]: 2192/5034 cut-off events. [2023-11-29 06:42:26,682 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2023-11-29 06:42:26,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8356 conditions, 5034 events. 2192/5034 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 43802 event pairs, 2192 based on Foata normal form. 632/5216 useless extension candidates. Maximal degree in co-relation 7278. Up to 3091 conditions per place. [2023-11-29 06:42:26,732 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 26 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-29 06:42:26,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 76 transitions, 232 flow [2023-11-29 06:42:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:42:26,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:42:26,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:42:26,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:42:26,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:26,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:42:26,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:26,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:26,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:26,759 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 192 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:42:26,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 76 transitions, 232 flow [2023-11-29 06:42:26,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-29 06:42:26,827 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 164 flow [2023-11-29 06:42:26,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2023-11-29 06:42:26,832 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -10 predicate places. [2023-11-29 06:42:26,833 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 164 flow [2023-11-29 06:42:26,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:26,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:26,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:42:26,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:42:26,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:26,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash 8627, now seen corresponding path program 1 times [2023-11-29 06:42:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:26,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980603883] [2023-11-29 06:42:26,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:26,976 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-29 06:42:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980603883] [2023-11-29 06:42:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980603883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361010772] [2023-11-29 06:42:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:26,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:27,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:27,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:27,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:27,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:27,403 INFO L124 PetriNetUnfolderBase]: 1532/3610 cut-off events. [2023-11-29 06:42:27,403 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:42:27,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5885 conditions, 3610 events. 1532/3610 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 30163 event pairs, 1532 based on Foata normal form. 226/3566 useless extension candidates. Maximal degree in co-relation 5875. Up to 2205 conditions per place. [2023-11-29 06:42:27,430 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-29 06:42:27,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 212 flow [2023-11-29 06:42:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:42:27,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:42:27,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:42:27,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:42:27,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:27,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:42:27,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,439 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 164 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:42:27,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 212 flow [2023-11-29 06:42:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:27,442 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 160 flow [2023-11-29 06:42:27,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2023-11-29 06:42:27,443 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -12 predicate places. [2023-11-29 06:42:27,444 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 160 flow [2023-11-29 06:42:27,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:27,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:42:27,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:42:27,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:27,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash 257262780, now seen corresponding path program 1 times [2023-11-29 06:42:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703277928] [2023-11-29 06:42:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:27,520 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-29 06:42:27,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703277928] [2023-11-29 06:42:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703277928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243011227] [2023-11-29 06:42:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:27,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:27,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:42:27,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:27,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:42:27,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:27,883 INFO L124 PetriNetUnfolderBase]: 1704/3987 cut-off events. [2023-11-29 06:42:27,883 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-29 06:42:27,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 3987 events. 1704/3987 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 33591 event pairs, 1704 based on Foata normal form. 0/3706 useless extension candidates. Maximal degree in co-relation 6502. Up to 2455 conditions per place. [2023-11-29 06:42:27,947 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 26 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-29 06:42:27,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 212 flow [2023-11-29 06:42:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-11-29 06:42:27,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7191011235955056 [2023-11-29 06:42:27,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-11-29 06:42:27,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-11-29 06:42:27,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:27,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-11-29 06:42:27,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,953 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 160 flow. Second operand 3 states and 192 transitions. [2023-11-29 06:42:27,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 212 flow [2023-11-29 06:42:27,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:27,955 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 156 flow [2023-11-29 06:42:27,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2023-11-29 06:42:27,957 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2023-11-29 06:42:27,957 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 156 flow [2023-11-29 06:42:27,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:27,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:27,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:42:27,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:42:27,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:27,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash 257262781, now seen corresponding path program 1 times [2023-11-29 06:42:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357824798] [2023-11-29 06:42:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:28,063 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-29 06:42:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357824798] [2023-11-29 06:42:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357824798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:28,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:28,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267207622] [2023-11-29 06:42:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:28,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:28,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:28,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:28,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:28,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:28,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:28,491 INFO L124 PetriNetUnfolderBase]: 1532/3574 cut-off events. [2023-11-29 06:42:28,491 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:42:28,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5849 conditions, 3574 events. 1532/3574 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29727 event pairs, 1532 based on Foata normal form. 63/3403 useless extension candidates. Maximal degree in co-relation 5839. Up to 2205 conditions per place. [2023-11-29 06:42:28,518 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 06:42:28,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 204 flow [2023-11-29 06:42:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:42:28,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:42:28,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:42:28,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:42:28,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:28,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:42:28,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:28,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:28,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:28,523 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 156 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:42:28,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 204 flow [2023-11-29 06:42:28,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:28,526 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 152 flow [2023-11-29 06:42:28,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-11-29 06:42:28,527 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2023-11-29 06:42:28,528 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 152 flow [2023-11-29 06:42:28,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:28,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:28,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:28,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:42:28,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:28,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1894112150, now seen corresponding path program 1 times [2023-11-29 06:42:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:28,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684768352] [2023-11-29 06:42:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:28,602 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-29 06:42:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684768352] [2023-11-29 06:42:28,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684768352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:28,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:28,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763729792] [2023-11-29 06:42:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:28,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:28,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:42:28,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:28,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:28,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:42:28,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:29,005 INFO L124 PetriNetUnfolderBase]: 1576/3652 cut-off events. [2023-11-29 06:42:29,005 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:42:29,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6001 conditions, 3652 events. 1576/3652 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 30447 event pairs, 1576 based on Foata normal form. 0/3433 useless extension candidates. Maximal degree in co-relation 5991. Up to 2279 conditions per place. [2023-11-29 06:42:29,029 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 26 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 06:42:29,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 204 flow [2023-11-29 06:42:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-11-29 06:42:29,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7191011235955056 [2023-11-29 06:42:29,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-11-29 06:42:29,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-11-29 06:42:29,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:29,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-11-29 06:42:29,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,034 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 152 flow. Second operand 3 states and 192 transitions. [2023-11-29 06:42:29,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 204 flow [2023-11-29 06:42:29,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:29,037 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 148 flow [2023-11-29 06:42:29,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-11-29 06:42:29,038 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -18 predicate places. [2023-11-29 06:42:29,038 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 148 flow [2023-11-29 06:42:29,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:29,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:29,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:42:29,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:29,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1894112151, now seen corresponding path program 1 times [2023-11-29 06:42:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:29,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321648053] [2023-11-29 06:42:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:29,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-29 06:42:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321648053] [2023-11-29 06:42:29,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321648053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:29,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491654272] [2023-11-29 06:42:29,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:29,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:29,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:29,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:29,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:29,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:29,568 INFO L124 PetriNetUnfolderBase]: 1532/3562 cut-off events. [2023-11-29 06:42:29,568 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:42:29,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5837 conditions, 3562 events. 1532/3562 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29567 event pairs, 1532 based on Foata normal form. 27/3367 useless extension candidates. Maximal degree in co-relation 5827. Up to 2205 conditions per place. [2023-11-29 06:42:29,593 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 06:42:29,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 196 flow [2023-11-29 06:42:29,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:42:29,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:42:29,595 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:42:29,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:42:29,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:29,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:42:29,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,598 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 148 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:42:29,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 196 flow [2023-11-29 06:42:29,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:29,601 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 144 flow [2023-11-29 06:42:29,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2023-11-29 06:42:29,602 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -20 predicate places. [2023-11-29 06:42:29,602 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 144 flow [2023-11-29 06:42:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:29,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:29,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:42:29,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:29,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 215014010, now seen corresponding path program 1 times [2023-11-29 06:42:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663393544] [2023-11-29 06:42:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:29,651 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-29 06:42:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663393544] [2023-11-29 06:42:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663393544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571797763] [2023-11-29 06:42:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:29,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:29,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:29,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:42:29,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:29,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:29,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:42:29,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:30,016 INFO L124 PetriNetUnfolderBase]: 1632/3629 cut-off events. [2023-11-29 06:42:30,016 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:42:30,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6054 conditions, 3629 events. 1632/3629 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 29384 event pairs, 1632 based on Foata normal form. 0/3477 useless extension candidates. Maximal degree in co-relation 6044. Up to 2355 conditions per place. [2023-11-29 06:42:30,041 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 26 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 06:42:30,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 196 flow [2023-11-29 06:42:30,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-11-29 06:42:30,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7191011235955056 [2023-11-29 06:42:30,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-11-29 06:42:30,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-11-29 06:42:30,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:30,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-11-29 06:42:30,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,046 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 144 flow. Second operand 3 states and 192 transitions. [2023-11-29 06:42:30,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 196 flow [2023-11-29 06:42:30,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:30,048 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 140 flow [2023-11-29 06:42:30,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2023-11-29 06:42:30,049 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-11-29 06:42:30,049 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 140 flow [2023-11-29 06:42:30,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:30,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:30,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:42:30,050 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:30,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 215014011, now seen corresponding path program 1 times [2023-11-29 06:42:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316152328] [2023-11-29 06:42:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:30,119 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-29 06:42:30,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:30,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316152328] [2023-11-29 06:42:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316152328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:30,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821708270] [2023-11-29 06:42:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:30,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:30,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:30,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:42:30,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:30,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:30,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:30,492 INFO L124 PetriNetUnfolderBase]: 1532/3470 cut-off events. [2023-11-29 06:42:30,492 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:42:30,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5745 conditions, 3470 events. 1532/3470 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 28243 event pairs, 1532 based on Foata normal form. 49/3389 useless extension candidates. Maximal degree in co-relation 5735. Up to 2205 conditions per place. [2023-11-29 06:42:30,513 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 06:42:30,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 188 flow [2023-11-29 06:42:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:42:30,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:42:30,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:42:30,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:42:30,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:30,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:42:30,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:30,517 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 140 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:42:30,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 188 flow [2023-11-29 06:42:30,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:30,519 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 136 flow [2023-11-29 06:42:30,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2023-11-29 06:42:30,520 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-29 06:42:30,520 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 136 flow [2023-11-29 06:42:30,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:42:30,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:30,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:30,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:42:30,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:30,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:30,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1451812211, now seen corresponding path program 1 times [2023-11-29 06:42:30,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057024244] [2023-11-29 06:42:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:30,583 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-29 06:42:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057024244] [2023-11-29 06:42:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057024244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:30,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:30,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070498055] [2023-11-29 06:42:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:30,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:30,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:42:30,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 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-29 06:42:30,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:30,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:42:30,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:32,358 INFO L124 PetriNetUnfolderBase]: 14102/24968 cut-off events. [2023-11-29 06:42:32,358 INFO L125 PetriNetUnfolderBase]: For 569/569 co-relation queries the response was YES. [2023-11-29 06:42:32,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44950 conditions, 24968 events. 14102/24968 cut-off events. For 569/569 co-relation queries the response was YES. Maximal size of possible extension queue 1246. Compared 220516 event pairs, 1535 based on Foata normal form. 0/24393 useless extension candidates. Maximal degree in co-relation 44932. Up to 6266 conditions per place. [2023-11-29 06:42:32,480 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 182 selfloop transitions, 37 changer transitions 0/246 dead transitions. [2023-11-29 06:42:32,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 246 transitions, 977 flow [2023-11-29 06:42:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:42:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 06:42:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 859 transitions. [2023-11-29 06:42:32,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.742437337942956 [2023-11-29 06:42:32,484 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 859 transitions. [2023-11-29 06:42:32,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 859 transitions. [2023-11-29 06:42:32,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:32,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 859 transitions. [2023-11-29 06:42:32,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 66.07692307692308) internal successors, (859), 13 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:32,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:32,489 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:32,489 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 136 flow. Second operand 13 states and 859 transitions. [2023-11-29 06:42:32,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 246 transitions, 977 flow [2023-11-29 06:42:32,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 246 transitions, 969 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:32,494 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 375 flow [2023-11-29 06:42:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=375, PETRI_PLACES=87, PETRI_TRANSITIONS=101} [2023-11-29 06:42:32,495 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -6 predicate places. [2023-11-29 06:42:32,495 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 375 flow [2023-11-29 06:42:32,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 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-29 06:42:32,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:32,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:32,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:42:32,496 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:32,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1465384461, now seen corresponding path program 1 times [2023-11-29 06:42:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400601915] [2023-11-29 06:42:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:32,532 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-29 06:42:32,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400601915] [2023-11-29 06:42:32,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400601915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:32,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:32,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:42:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997210272] [2023-11-29 06:42:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:32,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:32,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:32,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:42:32,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:32,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:32,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:33,790 INFO L124 PetriNetUnfolderBase]: 7409/15154 cut-off events. [2023-11-29 06:42:33,790 INFO L125 PetriNetUnfolderBase]: For 5770/6213 co-relation queries the response was YES. [2023-11-29 06:42:33,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30758 conditions, 15154 events. 7409/15154 cut-off events. For 5770/6213 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 147672 event pairs, 2916 based on Foata normal form. 708/15044 useless extension candidates. Maximal degree in co-relation 24307. Up to 5305 conditions per place. [2023-11-29 06:42:33,907 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 41 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2023-11-29 06:42:33,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 510 flow [2023-11-29 06:42:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2023-11-29 06:42:33,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2023-11-29 06:42:33,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 217 transitions. [2023-11-29 06:42:33,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 217 transitions. [2023-11-29 06:42:33,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:33,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 217 transitions. [2023-11-29 06:42:33,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:33,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:33,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:33,913 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 375 flow. Second operand 3 states and 217 transitions. [2023-11-29 06:42:33,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 510 flow [2023-11-29 06:42:34,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 118 transitions, 510 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:42:34,294 INFO L231 Difference]: Finished difference. Result has 90 places, 101 transitions, 391 flow [2023-11-29 06:42:34,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=90, PETRI_TRANSITIONS=101} [2023-11-29 06:42:34,295 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -3 predicate places. [2023-11-29 06:42:34,295 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 101 transitions, 391 flow [2023-11-29 06:42:34,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:42:34,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:34,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:34,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:42:34,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:34,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1791583799, now seen corresponding path program 2 times [2023-11-29 06:42:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:34,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987053089] [2023-11-29 06:42:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:34,346 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-29 06:42:34,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987053089] [2023-11-29 06:42:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987053089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:34,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:42:34,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245197522] [2023-11-29 06:42:34,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:34,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:42:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:42:34,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:42:34,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:34,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 101 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:34,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:34,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:34,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:35,402 INFO L124 PetriNetUnfolderBase]: 6413/13177 cut-off events. [2023-11-29 06:42:35,402 INFO L125 PetriNetUnfolderBase]: For 6362/6557 co-relation queries the response was YES. [2023-11-29 06:42:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28036 conditions, 13177 events. 6413/13177 cut-off events. For 6362/6557 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 121276 event pairs, 1703 based on Foata normal form. 318/13131 useless extension candidates. Maximal degree in co-relation 24971. Up to 3859 conditions per place. [2023-11-29 06:42:35,476 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 63 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-11-29 06:42:35,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 145 transitions, 660 flow [2023-11-29 06:42:35,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:42:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:42:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 298 transitions. [2023-11-29 06:42:35,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8370786516853933 [2023-11-29 06:42:35,478 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 298 transitions. [2023-11-29 06:42:35,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 298 transitions. [2023-11-29 06:42:35,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:35,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 298 transitions. [2023-11-29 06:42:35,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,482 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,482 INFO L175 Difference]: Start difference. First operand has 90 places, 101 transitions, 391 flow. Second operand 4 states and 298 transitions. [2023-11-29 06:42:35,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 145 transitions, 660 flow [2023-11-29 06:42:35,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 145 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:35,599 INFO L231 Difference]: Finished difference. Result has 94 places, 109 transitions, 457 flow [2023-11-29 06:42:35,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=457, PETRI_PLACES=94, PETRI_TRANSITIONS=109} [2023-11-29 06:42:35,600 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2023-11-29 06:42:35,600 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 109 transitions, 457 flow [2023-11-29 06:42:35,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:35,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:35,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:42:35,601 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:35,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2095153151, now seen corresponding path program 1 times [2023-11-29 06:42:35,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562926446] [2023-11-29 06:42:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:35,662 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-29 06:42:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562926446] [2023-11-29 06:42:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562926446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417094391] [2023-11-29 06:42:35,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:35,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:35,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:35,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:42:35,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 109 transitions, 457 flow. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:35,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:35,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:42:35,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:38,000 INFO L124 PetriNetUnfolderBase]: 13462/23238 cut-off events. [2023-11-29 06:42:38,000 INFO L125 PetriNetUnfolderBase]: For 21248/21969 co-relation queries the response was YES. [2023-11-29 06:42:38,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57109 conditions, 23238 events. 13462/23238 cut-off events. For 21248/21969 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 191812 event pairs, 2029 based on Foata normal form. 468/23314 useless extension candidates. Maximal degree in co-relation 52783. Up to 5104 conditions per place. [2023-11-29 06:42:38,119 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 204 selfloop transitions, 70 changer transitions 0/314 dead transitions. [2023-11-29 06:42:38,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 314 transitions, 1842 flow [2023-11-29 06:42:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:42:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 06:42:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 845 transitions. [2023-11-29 06:42:38,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7303370786516854 [2023-11-29 06:42:38,123 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 845 transitions. [2023-11-29 06:42:38,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 845 transitions. [2023-11-29 06:42:38,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:38,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 845 transitions. [2023-11-29 06:42:38,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.0) internal successors, (845), 13 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:38,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:38,130 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:38,130 INFO L175 Difference]: Start difference. First operand has 94 places, 109 transitions, 457 flow. Second operand 13 states and 845 transitions. [2023-11-29 06:42:38,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 314 transitions, 1842 flow [2023-11-29 06:42:38,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 314 transitions, 1842 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:42:38,480 INFO L231 Difference]: Finished difference. Result has 116 places, 168 transitions, 1060 flow [2023-11-29 06:42:38,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1060, PETRI_PLACES=116, PETRI_TRANSITIONS=168} [2023-11-29 06:42:38,480 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 23 predicate places. [2023-11-29 06:42:38,481 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 168 transitions, 1060 flow [2023-11-29 06:42:38,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:38,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:38,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:38,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:42:38,482 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:38,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1939781929, now seen corresponding path program 1 times [2023-11-29 06:42:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:38,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355124190] [2023-11-29 06:42:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:38,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:38,547 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-29 06:42:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355124190] [2023-11-29 06:42:38,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355124190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:38,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:38,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054180146] [2023-11-29 06:42:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:38,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:38,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:38,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:42:38,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 168 transitions, 1060 flow. Second operand has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:38,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:38,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:42:38,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:41,515 INFO L124 PetriNetUnfolderBase]: 14310/24733 cut-off events. [2023-11-29 06:42:41,516 INFO L125 PetriNetUnfolderBase]: For 36428/36773 co-relation queries the response was YES. [2023-11-29 06:42:41,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71323 conditions, 24733 events. 14310/24733 cut-off events. For 36428/36773 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 205445 event pairs, 3047 based on Foata normal form. 444/24940 useless extension candidates. Maximal degree in co-relation 66975. Up to 7174 conditions per place. [2023-11-29 06:42:41,682 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 201 selfloop transitions, 87 changer transitions 0/328 dead transitions. [2023-11-29 06:42:41,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 328 transitions, 2378 flow [2023-11-29 06:42:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:42:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 06:42:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 825 transitions. [2023-11-29 06:42:41,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7130509939498704 [2023-11-29 06:42:41,686 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 825 transitions. [2023-11-29 06:42:41,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 825 transitions. [2023-11-29 06:42:41,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:41,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 825 transitions. [2023-11-29 06:42:41,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 63.46153846153846) internal successors, (825), 13 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:41,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:41,692 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:41,692 INFO L175 Difference]: Start difference. First operand has 116 places, 168 transitions, 1060 flow. Second operand 13 states and 825 transitions. [2023-11-29 06:42:41,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 328 transitions, 2378 flow [2023-11-29 06:42:42,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 328 transitions, 2376 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 06:42:42,665 INFO L231 Difference]: Finished difference. Result has 132 places, 197 transitions, 1538 flow [2023-11-29 06:42:42,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1538, PETRI_PLACES=132, PETRI_TRANSITIONS=197} [2023-11-29 06:42:42,666 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 39 predicate places. [2023-11-29 06:42:42,666 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 197 transitions, 1538 flow [2023-11-29 06:42:42,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:42,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:42,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:42,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:42:42,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:42,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1122724535, now seen corresponding path program 1 times [2023-11-29 06:42:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:42,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91791722] [2023-11-29 06:42:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:42,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:42,758 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-29 06:42:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91791722] [2023-11-29 06:42:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91791722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834096540] [2023-11-29 06:42:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:42,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:42,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:42,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:42,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:42:42,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 197 transitions, 1538 flow. Second operand has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:42,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:42,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:42:42,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:46,000 INFO L124 PetriNetUnfolderBase]: 15061/25949 cut-off events. [2023-11-29 06:42:46,001 INFO L125 PetriNetUnfolderBase]: For 55887/56479 co-relation queries the response was YES. [2023-11-29 06:42:46,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78653 conditions, 25949 events. 15061/25949 cut-off events. For 55887/56479 co-relation queries the response was YES. Maximal size of possible extension queue 1308. Compared 215421 event pairs, 3000 based on Foata normal form. 670/26344 useless extension candidates. Maximal degree in co-relation 74721. Up to 7244 conditions per place. [2023-11-29 06:42:46,226 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 215 selfloop transitions, 94 changer transitions 0/363 dead transitions. [2023-11-29 06:42:46,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 363 transitions, 2946 flow [2023-11-29 06:42:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:42:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 06:42:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 827 transitions. [2023-11-29 06:42:46,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147796024200519 [2023-11-29 06:42:46,230 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 827 transitions. [2023-11-29 06:42:46,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 827 transitions. [2023-11-29 06:42:46,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:46,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 827 transitions. [2023-11-29 06:42:46,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 63.61538461538461) internal successors, (827), 13 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:46,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:46,237 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:46,237 INFO L175 Difference]: Start difference. First operand has 132 places, 197 transitions, 1538 flow. Second operand 13 states and 827 transitions. [2023-11-29 06:42:46,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 363 transitions, 2946 flow [2023-11-29 06:42:47,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 363 transitions, 2932 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-29 06:42:47,793 INFO L231 Difference]: Finished difference. Result has 147 places, 226 transitions, 2032 flow [2023-11-29 06:42:47,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2032, PETRI_PLACES=147, PETRI_TRANSITIONS=226} [2023-11-29 06:42:47,794 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 54 predicate places. [2023-11-29 06:42:47,794 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 226 transitions, 2032 flow [2023-11-29 06:42:47,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:47,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:47,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:47,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:42:47,795 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:47,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1171582728, now seen corresponding path program 1 times [2023-11-29 06:42:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400585138] [2023-11-29 06:42:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:42:47,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:42:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:42:47,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:42:47,864 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:42:47,865 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-11-29 06:42:47,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-11-29 06:42:47,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-11-29 06:42:47,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-11-29 06:42:47,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-11-29 06:42:47,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-11-29 06:42:47,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-11-29 06:42:47,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-11-29 06:42:47,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-11-29 06:42:47,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-11-29 06:42:47,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-11-29 06:42:47,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-11-29 06:42:47,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-11-29 06:42:47,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-11-29 06:42:47,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-11-29 06:42:47,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-11-29 06:42:47,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-11-29 06:42:47,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-11-29 06:42:47,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-11-29 06:42:47,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-11-29 06:42:47,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-11-29 06:42:47,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-11-29 06:42:47,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-11-29 06:42:47,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-11-29 06:42:47,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:42:47,871 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:42:47,876 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:42:47,877 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:42:47,913 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2023-11-29 06:42:47,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-29 06:42:47,914 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated [2023-11-29 06:42:47,916 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-29 06:42:47,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:42:47 BasicIcfg [2023-11-29 06:42:47,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:42:47,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:42:47,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:42:47,928 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:42:47,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:25" (3/4) ... [2023-11-29 06:42:47,929 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:42:47,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:42:47,931 INFO L158 Benchmark]: Toolchain (without parser) took 23596.65ms. Allocated memory was 146.8MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 115.0MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-29 06:42:47,931 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:42:47,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.35ms. Allocated memory is still 146.8MB. Free memory was 114.6MB in the beginning and 94.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 06:42:47,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.41ms. Allocated memory is still 146.8MB. Free memory was 94.7MB in the beginning and 92.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:42:47,932 INFO L158 Benchmark]: Boogie Preprocessor took 48.85ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:42:47,932 INFO L158 Benchmark]: RCFGBuilder took 521.25ms. Allocated memory is still 146.8MB. Free memory was 89.6MB in the beginning and 114.5MB in the end (delta: -24.9MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2023-11-29 06:42:47,932 INFO L158 Benchmark]: TraceAbstraction took 22544.19ms. Allocated memory was 180.4MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 149.5MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-29 06:42:47,933 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 5.7GB. Free memory is still 4.7GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:42:47,934 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.20ms. Allocated memory is still 109.1MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.35ms. Allocated memory is still 146.8MB. Free memory was 114.6MB in the beginning and 94.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.41ms. Allocated memory is still 146.8MB. Free memory was 94.7MB in the beginning and 92.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.85ms. Allocated memory is still 146.8MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.25ms. Allocated memory is still 146.8MB. Free memory was 89.6MB in the beginning and 114.5MB in the end (delta: -24.9MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22544.19ms. Allocated memory was 180.4MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 149.5MB in the beginning and 4.7GB in the end (delta: -4.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 5.7GB. Free memory is still 4.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1={8:0}, t2={6:0}, t3={7:0}, t4={5:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1={8:0}, t2={6:0}, t3={7:0}, t4={5:0}, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1={8:0}, t2={6:0}, t3={7:0}, t4={5:0}, w=0, x=0, y=0] [L724] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1={8:0}, t2={6:0}, t3={7:0}, t4={5:0}, w=0, x=0, y=0] [L724] 4 int l; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 111 locations, 24 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: 22.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1307 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 984 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2357 IncrementalHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 103 mSDtfsCounter, 2357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2032occurred in iteration=14, InterpolantAutomatonStates: 83, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 06:42:47,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya --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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:42:50,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:42:50,159 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 06:42:50,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:42:50,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:42:50,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:42:50,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:42:50,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:42:50,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:42:50,198 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:42:50,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:42:50,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:42:50,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:42:50,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:42:50,202 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:42:50,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:42:50,203 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:42:50,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:42:50,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:42:50,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:42:50,205 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:42:50,206 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:42:50,206 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:42:50,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:42:50,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:42:50,208 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:42:50,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:42:50,208 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:42:50,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:42:50,209 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:42:50,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:42:50,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:42:50,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:42:50,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:42:50,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:50,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:42:50,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:42:50,212 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:42:50,212 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:42:50,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:42:50,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:42:50,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:42:50,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:42:50,213 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:42:50,214 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_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/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_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2023-11-29 06:42:50,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:42:50,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:42:50,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:42:50,522 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:42:50,523 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:42:50,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-29 06:42:53,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:42:53,567 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:42:53,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-29 06:42:53,584 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data/860ec8803/8ceba1bd9ffa468ca6a391f6bcd88519/FLAGa4d2c687e [2023-11-29 06:42:53,598 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/data/860ec8803/8ceba1bd9ffa468ca6a391f6bcd88519 [2023-11-29 06:42:53,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:42:53,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:42:53,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:53,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:42:53,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:42:53,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:53" (1/1) ... [2023-11-29 06:42:53,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dbcc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:53, skipping insertion in model container [2023-11-29 06:42:53,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:53" (1/1) ... [2023-11-29 06:42:53,657 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:42:54,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:54,016 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:42:54,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:54,124 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:42:54,131 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:42:54,140 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:42:54,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54 WrapperNode [2023-11-29 06:42:54,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:54,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:54,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:42:54,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:42:54,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,195 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 122 [2023-11-29 06:42:54,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:54,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:42:54,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:42:54,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:42:54,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,231 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 06:42:54,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:42:54,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:42:54,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:42:54,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:42:54,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (1/1) ... [2023-11-29 06:42:54,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:54,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:54,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:42:54,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:42:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 06:42:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 06:42:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 06:42:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 06:42:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 06:42:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:42:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:42:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-29 06:42:54,328 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-29 06:42:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:42:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:42:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:42:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:42:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:42:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:42:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 06:42:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:42:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:42:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:42:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:42:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 06:42:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:42:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:42:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:42:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-29 06:42:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-29 06:42:54,333 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 06:42:54,486 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:42:54,489 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:42:54,794 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:42:54,944 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:42:54,944 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 06:42:54,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:54 BoogieIcfgContainer [2023-11-29 06:42:54,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:42:54,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:42:54,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:42:54,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:42:54,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:42:53" (1/3) ... [2023-11-29 06:42:54,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb9fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:54, skipping insertion in model container [2023-11-29 06:42:54,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:54" (2/3) ... [2023-11-29 06:42:54,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb9fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:54, skipping insertion in model container [2023-11-29 06:42:54,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:54" (3/3) ... [2023-11-29 06:42:54,952 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-11-29 06:42:54,966 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:42:54,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-29 06:42:54,967 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:42:55,027 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 06:42:55,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 89 transitions, 206 flow [2023-11-29 06:42:55,098 INFO L124 PetriNetUnfolderBase]: 4/85 cut-off events. [2023-11-29 06:42:55,098 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 06:42:55,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 85 events. 4/85 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-11-29 06:42:55,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 89 transitions, 206 flow [2023-11-29 06:42:55,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 84 transitions, 192 flow [2023-11-29 06:42:55,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:42:55,135 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;@1c2fc4a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:42:55,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-29 06:42:55,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:42:55,138 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 06:42:55,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:42:55,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:55,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:42:55,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:55,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 8690, now seen corresponding path program 1 times [2023-11-29 06:42:55,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:42:55,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752964863] [2023-11-29 06:42:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:55,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:42:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:42:55,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:42:55,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 06:42:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:42:55,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:55,448 INFO L349 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2023-11-29 06:42:55,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 40 [2023-11-29 06:42:55,529 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-29 06:42:55,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 40 [2023-11-29 06:42:55,623 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-29 06:42:55,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:42:55,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:42:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752964863] [2023-11-29 06:42:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752964863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:55,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976980346] [2023-11-29 06:42:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:55,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:42:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:55,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:55,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:55,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:55,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:55,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:55,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:56,529 INFO L124 PetriNetUnfolderBase]: 1532/3656 cut-off events. [2023-11-29 06:42:56,530 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2023-11-29 06:42:56,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6092 conditions, 3656 events. 1532/3656 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 30910 event pairs, 1532 based on Foata normal form. 693/4033 useless extension candidates. Maximal degree in co-relation 5148. Up to 2205 conditions per place. [2023-11-29 06:42:56,575 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-29 06:42:56,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 76 transitions, 228 flow [2023-11-29 06:42:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2023-11-29 06:42:56,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7490636704119851 [2023-11-29 06:42:56,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 200 transitions. [2023-11-29 06:42:56,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 200 transitions. [2023-11-29 06:42:56,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:56,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 200 transitions. [2023-11-29 06:42:56,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:56,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:56,601 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:56,603 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 192 flow. Second operand 3 states and 200 transitions. [2023-11-29 06:42:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 76 transitions, 228 flow [2023-11-29 06:42:56,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 212 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-29 06:42:56,614 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 164 flow [2023-11-29 06:42:56,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2023-11-29 06:42:56,620 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -10 predicate places. [2023-11-29 06:42:56,620 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 164 flow [2023-11-29 06:42:56,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:56,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:56,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 06:42:56,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:42:56,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:42:56,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:56,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash 8691, now seen corresponding path program 1 times [2023-11-29 06:42:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:42:56,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711146025] [2023-11-29 06:42:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:56,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:42:56,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:42:56,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:42:56,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 06:42:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 06:42:56,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:56,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:56,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:56,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:56,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2023-11-29 06:42:56,988 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 06:42:56,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-29 06:42:57,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:57,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:57,067 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-11-29 06:42:57,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 16 [2023-11-29 06:42:57,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:57,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-11-29 06:42:57,156 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-29 06:42:57,156 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:42:57,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:42:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711146025] [2023-11-29 06:42:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711146025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:57,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:57,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314286152] [2023-11-29 06:42:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:57,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:57,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:42:57,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:57,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:57,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:42:57,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:57,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:57,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:42:57,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:57,867 INFO L124 PetriNetUnfolderBase]: 1532/3610 cut-off events. [2023-11-29 06:42:57,867 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:42:57,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5885 conditions, 3610 events. 1532/3610 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 30163 event pairs, 1532 based on Foata normal form. 226/3566 useless extension candidates. Maximal degree in co-relation 5875. Up to 2205 conditions per place. [2023-11-29 06:42:57,901 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-29 06:42:57,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 212 flow [2023-11-29 06:42:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:42:57,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:42:57,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:42:57,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:42:57,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:57,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:42:57,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:57,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:57,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:57,909 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 164 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:42:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 212 flow [2023-11-29 06:42:57,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:57,930 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 160 flow [2023-11-29 06:42:57,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2023-11-29 06:42:57,932 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -12 predicate places. [2023-11-29 06:42:57,932 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 160 flow [2023-11-29 06:42:57,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:57,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:57,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:42:57,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:42:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:42:58,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:58,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 259171390, now seen corresponding path program 1 times [2023-11-29 06:42:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:42:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501547594] [2023-11-29 06:42:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:58,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:42:58,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:42:58,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:42:58,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 06:42:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:42:58,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:58,276 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:42:58,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2023-11-29 06:42:58,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:58,311 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 06:42:58,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 06:42:58,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:58,353 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:42:58,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 06:42:58,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:58,413 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 06:42:58,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2023-11-29 06:42:58,449 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 06:42:58,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 06:42:58,471 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:42:58,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-29 06:42:58,499 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:42:58,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2023-11-29 06:42:58,531 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 06:42:58,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-11-29 06:42:58,756 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-29 06:42:58,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:42:58,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:42:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501547594] [2023-11-29 06:42:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501547594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:42:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566906190] [2023-11-29 06:42:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:58,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:42:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:58,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:42:58,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:58,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:42:58,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:42:58,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:42:59,439 INFO L124 PetriNetUnfolderBase]: 1704/3987 cut-off events. [2023-11-29 06:42:59,439 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-29 06:42:59,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 3987 events. 1704/3987 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 33591 event pairs, 1704 based on Foata normal form. 0/3706 useless extension candidates. Maximal degree in co-relation 6502. Up to 2455 conditions per place. [2023-11-29 06:42:59,473 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 26 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-29 06:42:59,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 212 flow [2023-11-29 06:42:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:42:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-11-29 06:42:59,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7191011235955056 [2023-11-29 06:42:59,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-11-29 06:42:59,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-11-29 06:42:59,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:42:59,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-11-29 06:42:59,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:59,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:59,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:59,481 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 160 flow. Second operand 3 states and 192 transitions. [2023-11-29 06:42:59,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 212 flow [2023-11-29 06:42:59,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:42:59,483 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 156 flow [2023-11-29 06:42:59,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2023-11-29 06:42:59,484 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2023-11-29 06:42:59,485 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 156 flow [2023-11-29 06:42:59,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:42:59,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:42:59,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:42:59,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 06:42:59,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:42:59,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:42:59,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash 259171391, now seen corresponding path program 1 times [2023-11-29 06:42:59,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:42:59,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951989705] [2023-11-29 06:42:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:42:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:42:59,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:42:59,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 06:42:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:59,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:42:59,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:42:59,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 06:42:59,818 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:42:59,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:42:59,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:42:59,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:42:59,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 06:42:59,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,894 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:42:59,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:42:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 06:42:59,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:42:59,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 06:42:59,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,979 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:42:59,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 06:42:59,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:42:59,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 06:43:00,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:00,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:43:00,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:00,048 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:00,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:43:00,403 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-29 06:43:00,403 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:00,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:00,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951989705] [2023-11-29 06:43:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951989705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:43:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952695841] [2023-11-29 06:43:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:00,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:00,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:00,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:00,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:43:00,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:00,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:00,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:43:00,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:00,957 INFO L124 PetriNetUnfolderBase]: 1532/3574 cut-off events. [2023-11-29 06:43:00,957 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:43:00,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5849 conditions, 3574 events. 1532/3574 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29727 event pairs, 1532 based on Foata normal form. 63/3403 useless extension candidates. Maximal degree in co-relation 5839. Up to 2205 conditions per place. [2023-11-29 06:43:00,986 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 06:43:00,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 204 flow [2023-11-29 06:43:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:43:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:43:00,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:43:00,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:43:00,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:43:00,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:00,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:43:00,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:00,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:00,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:00,991 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 156 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:43:00,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 204 flow [2023-11-29 06:43:00,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:43:00,994 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 152 flow [2023-11-29 06:43:00,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-11-29 06:43:00,995 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2023-11-29 06:43:00,995 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 152 flow [2023-11-29 06:43:00,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:00,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:00,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:00,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 06:43:01,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:01,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:01,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1376027498, now seen corresponding path program 1 times [2023-11-29 06:43:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433683421] [2023-11-29 06:43:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:01,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:01,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:01,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:01,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 06:43:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:43:01,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:01,341 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-11-29 06:43:01,370 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 06:43:01,399 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 06:43:01,423 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 06:43:01,450 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 06:43:01,471 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 06:43:01,500 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 06:43:01,524 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 06:43:01,543 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 06:43:01,564 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 06:43:01,592 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 06:43:01,612 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:43:01,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 06:43:01,793 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-29 06:43:01,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:01,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433683421] [2023-11-29 06:43:01,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433683421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:01,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:01,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:43:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625137285] [2023-11-29 06:43:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:01,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:01,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:01,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:43:01,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:01,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:01,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:43:01,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:02,228 INFO L124 PetriNetUnfolderBase]: 1576/3652 cut-off events. [2023-11-29 06:43:02,228 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:43:02,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6001 conditions, 3652 events. 1576/3652 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 30447 event pairs, 1576 based on Foata normal form. 0/3433 useless extension candidates. Maximal degree in co-relation 5991. Up to 2279 conditions per place. [2023-11-29 06:43:02,249 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 26 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 06:43:02,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 204 flow [2023-11-29 06:43:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:43:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-11-29 06:43:02,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7191011235955056 [2023-11-29 06:43:02,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-11-29 06:43:02,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-11-29 06:43:02,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:02,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-11-29 06:43:02,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:02,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:02,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:02,254 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 152 flow. Second operand 3 states and 192 transitions. [2023-11-29 06:43:02,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 204 flow [2023-11-29 06:43:02,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:43:02,257 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 148 flow [2023-11-29 06:43:02,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-11-29 06:43:02,258 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -18 predicate places. [2023-11-29 06:43:02,259 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 148 flow [2023-11-29 06:43:02,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:02,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:02,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:02,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:02,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:02,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:02,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1376027497, now seen corresponding path program 1 times [2023-11-29 06:43:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064307035] [2023-11-29 06:43:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:02,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:02,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:02,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:02,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 06:43:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:43:02,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:02,591 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:43:02,622 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:43:02,642 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:43:02,680 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 06:43:02,707 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:43:02,737 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:43:02,766 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:43:02,791 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:43:02,816 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:43:02,838 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:43:02,858 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-29 06:43:02,883 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:43:02,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-29 06:43:03,082 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-29 06:43:03,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:03,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:03,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064307035] [2023-11-29 06:43:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064307035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:03,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:43:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282669606] [2023-11-29 06:43:03,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:03,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:03,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:03,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:43:03,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:03,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:03,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:43:03,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:03,519 INFO L124 PetriNetUnfolderBase]: 1532/3562 cut-off events. [2023-11-29 06:43:03,519 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:43:03,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5837 conditions, 3562 events. 1532/3562 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29567 event pairs, 1532 based on Foata normal form. 27/3367 useless extension candidates. Maximal degree in co-relation 5827. Up to 2205 conditions per place. [2023-11-29 06:43:03,540 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 06:43:03,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 196 flow [2023-11-29 06:43:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:43:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:43:03,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:43:03,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:43:03,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:43:03,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:03,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:43:03,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:03,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:03,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:03,545 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 148 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:43:03,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 196 flow [2023-11-29 06:43:03,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:43:03,548 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 144 flow [2023-11-29 06:43:03,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2023-11-29 06:43:03,549 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -20 predicate places. [2023-11-29 06:43:03,549 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 144 flow [2023-11-29 06:43:03,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:03,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:03,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:03,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 06:43:03,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:03,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:03,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2067029700, now seen corresponding path program 1 times [2023-11-29 06:43:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:03,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261746204] [2023-11-29 06:43:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:03,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:03,755 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:03,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 06:43:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:03,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:43:03,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:03,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:43:03,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:03,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:03,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:03,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:03,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:03,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:03,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:03,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:03,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:03,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:03,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:03,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:03,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:03,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:03,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-29 06:43:04,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:04,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:04,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:04,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,076 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-29 06:43:04,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:04,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261746204] [2023-11-29 06:43:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261746204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:43:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348298311] [2023-11-29 06:43:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:04,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:04,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:43:04,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:04,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:04,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:43:04,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:04,478 INFO L124 PetriNetUnfolderBase]: 1632/3629 cut-off events. [2023-11-29 06:43:04,479 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:43:04,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6054 conditions, 3629 events. 1632/3629 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 29384 event pairs, 1632 based on Foata normal form. 0/3477 useless extension candidates. Maximal degree in co-relation 6044. Up to 2355 conditions per place. [2023-11-29 06:43:04,503 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 26 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 06:43:04,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 196 flow [2023-11-29 06:43:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:43:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-11-29 06:43:04,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7191011235955056 [2023-11-29 06:43:04,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-11-29 06:43:04,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-11-29 06:43:04,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:04,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-11-29 06:43:04,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:04,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:04,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:04,508 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 144 flow. Second operand 3 states and 192 transitions. [2023-11-29 06:43:04,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 196 flow [2023-11-29 06:43:04,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:43:04,510 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 140 flow [2023-11-29 06:43:04,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2023-11-29 06:43:04,511 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-11-29 06:43:04,511 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 140 flow [2023-11-29 06:43:04,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:04,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:04,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:04,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:04,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:04,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:04,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2067029699, now seen corresponding path program 1 times [2023-11-29 06:43:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760780925] [2023-11-29 06:43:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:04,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:04,715 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:04,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 06:43:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:04,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:43:04,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:04,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-29 06:43:04,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-29 06:43:04,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:04,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:04,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:04,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:04,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 06:43:04,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:04,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:05,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:05,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 06:43:05,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:43:05,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-29 06:43:05,070 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-29 06:43:05,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:05,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:05,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760780925] [2023-11-29 06:43:05,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760780925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:05,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:05,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:43:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409204552] [2023-11-29 06:43:05,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:05,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:05,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:05,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:43:05,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:43:05,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:05,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:43:05,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:05,407 INFO L124 PetriNetUnfolderBase]: 1532/3470 cut-off events. [2023-11-29 06:43:05,407 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 06:43:05,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5745 conditions, 3470 events. 1532/3470 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 28243 event pairs, 1532 based on Foata normal form. 49/3389 useless extension candidates. Maximal degree in co-relation 5735. Up to 2205 conditions per place. [2023-11-29 06:43:05,430 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 24 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 06:43:05,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 188 flow [2023-11-29 06:43:05,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:43:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2023-11-29 06:43:05,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7340823970037453 [2023-11-29 06:43:05,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 196 transitions. [2023-11-29 06:43:05,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 196 transitions. [2023-11-29 06:43:05,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:05,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 196 transitions. [2023-11-29 06:43:05,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:05,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:05,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:05,435 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 140 flow. Second operand 3 states and 196 transitions. [2023-11-29 06:43:05,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 188 flow [2023-11-29 06:43:05,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:43:05,437 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 136 flow [2023-11-29 06:43:05,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2023-11-29 06:43:05,438 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-29 06:43:05,438 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 136 flow [2023-11-29 06:43:05,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:43:05,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:05,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:05,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 06:43:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:05,641 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:05,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash 845114293, now seen corresponding path program 1 times [2023-11-29 06:43:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912122150] [2023-11-29 06:43:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:05,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:05,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:05,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 06:43:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:05,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:43:05,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:05,782 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-29 06:43:05,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:05,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:05,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912122150] [2023-11-29 06:43:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912122150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108028249] [2023-11-29 06:43:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:05,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:43:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:43:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:43:05,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:43:05,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:05,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:05,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:43:05,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:07,336 INFO L124 PetriNetUnfolderBase]: 10045/18852 cut-off events. [2023-11-29 06:43:07,336 INFO L125 PetriNetUnfolderBase]: For 380/380 co-relation queries the response was YES. [2023-11-29 06:43:07,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33079 conditions, 18852 events. 10045/18852 cut-off events. For 380/380 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 165709 event pairs, 3007 based on Foata normal form. 0/18443 useless extension candidates. Maximal degree in co-relation 33065. Up to 8172 conditions per place. [2023-11-29 06:43:07,413 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 152 selfloop transitions, 35 changer transitions 0/214 dead transitions. [2023-11-29 06:43:07,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 214 transitions, 833 flow [2023-11-29 06:43:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:43:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 06:43:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 827 transitions. [2023-11-29 06:43:07,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7147796024200519 [2023-11-29 06:43:07,417 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 827 transitions. [2023-11-29 06:43:07,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 827 transitions. [2023-11-29 06:43:07,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:07,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 827 transitions. [2023-11-29 06:43:07,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 63.61538461538461) internal successors, (827), 13 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:07,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:07,425 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:07,425 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 136 flow. Second operand 13 states and 827 transitions. [2023-11-29 06:43:07,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 214 transitions, 833 flow [2023-11-29 06:43:07,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 214 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:43:07,429 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 349 flow [2023-11-29 06:43:07,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=349, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2023-11-29 06:43:07,430 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -7 predicate places. [2023-11-29 06:43:07,430 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 349 flow [2023-11-29 06:43:07,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:07,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:07,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:07,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:07,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:07,633 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:07,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash -458389713, now seen corresponding path program 1 times [2023-11-29 06:43:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387363962] [2023-11-29 06:43:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:07,635 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:07,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 06:43:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:07,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:43:07,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:07,718 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-29 06:43:07,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:07,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387363962] [2023-11-29 06:43:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387363962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:43:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847045962] [2023-11-29 06:43:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:07,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:07,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:07,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:43:07,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:43:07,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:07,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:43:07,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:08,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [26#L752-4true, 33#L16true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 69#L720true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:08,372 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 06:43:08,372 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 06:43:08,372 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 06:43:08,372 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 06:43:08,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [26#L752-4true, 33#L16true, 32#writerEXITtrue, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:08,405 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,406 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,406 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,406 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [33#L16true, 86#L753true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 69#L720true, 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:08,410 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,410 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,410 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,410 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:08,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [33#L16true, 32#writerEXITtrue, 86#L753true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:08,443 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 06:43:08,443 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:08,443 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:08,443 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:08,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [20#L753-2true, 33#L16true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:08,506 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 06:43:08,506 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:08,506 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:08,506 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:08,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [26#L752-4true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 69#L720true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:08,527 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-11-29 06:43:08,527 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-29 06:43:08,527 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-29 06:43:08,528 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-29 06:43:08,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [26#L752-4true, 32#writerEXITtrue, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:08,547 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,547 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,547 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,547 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [86#L753true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 69#L720true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:08,550 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,550 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,550 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,550 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-11-29 06:43:08,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [32#writerEXITtrue, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:08,568 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-11-29 06:43:08,568 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-29 06:43:08,568 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-29 06:43:08,568 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-11-29 06:43:08,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][56], [20#L753-2true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:08,602 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-11-29 06:43:08,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-29 06:43:08,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-29 06:43:08,602 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-11-29 06:43:08,681 INFO L124 PetriNetUnfolderBase]: 5230/10926 cut-off events. [2023-11-29 06:43:08,681 INFO L125 PetriNetUnfolderBase]: For 3163/3221 co-relation queries the response was YES. [2023-11-29 06:43:08,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21130 conditions, 10926 events. 5230/10926 cut-off events. For 3163/3221 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 101135 event pairs, 2425 based on Foata normal form. 558/10811 useless extension candidates. Maximal degree in co-relation 17150. Up to 4167 conditions per place. [2023-11-29 06:43:08,742 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 41 selfloop transitions, 4 changer transitions 0/117 dead transitions. [2023-11-29 06:43:08,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 484 flow [2023-11-29 06:43:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:43:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2023-11-29 06:43:08,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2023-11-29 06:43:08,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 217 transitions. [2023-11-29 06:43:08,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 217 transitions. [2023-11-29 06:43:08,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:08,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 217 transitions. [2023-11-29 06:43:08,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:08,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:08,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:08,747 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 349 flow. Second operand 3 states and 217 transitions. [2023-11-29 06:43:08,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 484 flow [2023-11-29 06:43:08,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:43:08,773 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 365 flow [2023-11-29 06:43:08,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=365, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2023-11-29 06:43:08,774 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -4 predicate places. [2023-11-29 06:43:08,774 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 365 flow [2023-11-29 06:43:08,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-29 06:43:08,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:08,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:08,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 06:43:08,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:08,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:08,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1106866231, now seen corresponding path program 2 times [2023-11-29 06:43:08,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:08,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842055000] [2023-11-29 06:43:08,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:43:08,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:08,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:08,978 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:08,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 06:43:09,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:43:09,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:43:09,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:43:09,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:09,081 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-29 06:43:09,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:09,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842055000] [2023-11-29 06:43:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842055000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:09,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:43:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815357596] [2023-11-29 06:43:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:09,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:43:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:43:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:43:09,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:43:09,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:09,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:09,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:43:09,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:09,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 26#L752-4true, 33#L16true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 69#L720true, 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:09,779 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 06:43:09,780 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 06:43:09,780 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 06:43:09,780 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 06:43:09,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 26#L752-4true, 33#L16true, 32#writerEXITtrue, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:09,838 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,838 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,838 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,838 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 33#L16true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 69#L720true, 265#true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:09,845 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,845 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,845 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,845 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 26#L752-4true, 32#writerEXITtrue, 88#$Ultimate##0true, Black: 353#(= ~w~0 (_ bv1 32)), 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 392#true]) [2023-11-29 06:43:09,878 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,878 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,879 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,879 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 06:43:09,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 33#L16true, 32#writerEXITtrue, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:09,909 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,909 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,909 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,909 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [26#L752-4true, 397#(= ~r~0 (_ bv0 32)), 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 69#L720true, 265#true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:09,919 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,919 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,919 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,919 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 32#writerEXITtrue, 88#$Ultimate##0true, Black: 353#(= ~w~0 (_ bv1 32)), 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 392#true]) [2023-11-29 06:43:09,956 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,956 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,956 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,956 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 26#L752-4true, 32#writerEXITtrue, 88#$Ultimate##0true, Black: 353#(= ~w~0 (_ bv1 32)), Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 28#readerEXITtrue, 392#true]) [2023-11-29 06:43:09,957 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,958 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,958 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,958 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 06:43:09,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [26#L752-4true, 397#(= ~r~0 (_ bv0 32)), 32#writerEXITtrue, 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:09,986 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,986 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,986 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,986 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 69#L720true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:09,995 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,995 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,995 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,995 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [26#L752-4true, 397#(= ~r~0 (_ bv0 32)), Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 69#L720true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:09,996 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:09,996 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:10,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 32#writerEXITtrue, 88#$Ultimate##0true, Black: 353#(= ~w~0 (_ bv1 32)), Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 28#readerEXITtrue, 392#true]) [2023-11-29 06:43:10,033 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 06:43:10,033 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:10,033 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:10,034 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 06:43:10,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 33#L16true, 20#L753-2true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:10,061 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,061 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,062 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,062 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 32#writerEXITtrue, 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:10,062 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,063 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,063 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,063 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 26#L752-4true, 32#writerEXITtrue, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:10,063 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,063 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,064 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,064 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 20#L753-2true, 88#$Ultimate##0true, Black: 353#(= ~w~0 (_ bv1 32)), 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 392#true]) [2023-11-29 06:43:10,068 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,068 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,068 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,068 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 69#L720true, 265#true, 57#L16true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:10,074 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,074 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,074 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,074 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 06:43:10,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 32#writerEXITtrue, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 86#L753true, Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:10,182 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,182 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,182 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,182 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 20#L753-2true, 88#$Ultimate##0true, Black: 353#(= ~w~0 (_ bv1 32)), Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 28#readerEXITtrue, 392#true]) [2023-11-29 06:43:10,188 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,188 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,188 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,188 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 06:43:10,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 20#L753-2true, 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 55#L714-1true]) [2023-11-29 06:43:10,247 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,247 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,247 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,247 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 26#L752-4true, 32#writerEXITtrue, Black: 353#(= ~w~0 (_ bv1 32)), 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 40#writerEXITtrue, 392#true]) [2023-11-29 06:43:10,268 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,268 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,268 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,268 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 06:43:10,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][114], [397#(= ~r~0 (_ bv0 32)), 20#L753-2true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 353#(= ~w~0 (_ bv1 32)), 28#readerEXITtrue, 55#L714-1true]) [2023-11-29 06:43:10,310 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,310 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,310 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,310 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 32#writerEXITtrue, Black: 353#(= ~w~0 (_ bv1 32)), 63#L744true, 86#L753true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 40#writerEXITtrue, 392#true]) [2023-11-29 06:43:10,322 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,322 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,323 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,323 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 26#L752-4true, 32#writerEXITtrue, Black: 353#(= ~w~0 (_ bv1 32)), Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 40#writerEXITtrue, 28#readerEXITtrue, 392#true]) [2023-11-29 06:43:10,324 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,324 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,324 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,324 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 06:43:10,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 32#writerEXITtrue, Black: 353#(= ~w~0 (_ bv1 32)), 86#L753true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 40#writerEXITtrue, 28#readerEXITtrue, 392#true]) [2023-11-29 06:43:10,373 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 06:43:10,373 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 06:43:10,373 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 06:43:10,373 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 06:43:10,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 20#L753-2true, Black: 353#(= ~w~0 (_ bv1 32)), 63#L744true, Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 57#L16true, 265#true, 40#writerEXITtrue, 392#true]) [2023-11-29 06:43:10,395 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 06:43:10,395 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 06:43:10,395 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 06:43:10,395 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 06:43:10,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][115], [336#true, 20#L753-2true, Black: 353#(= ~w~0 (_ bv1 32)), Black: 317#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 323#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 319#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 315#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 325#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 295#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 307#(and (= |readerThread1of1ForFork2_~lx~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32))), 265#true, 57#L16true, 40#writerEXITtrue, 28#readerEXITtrue, 392#true]) [2023-11-29 06:43:10,432 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 06:43:10,432 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 06:43:10,432 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 06:43:10,433 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 06:43:10,505 INFO L124 PetriNetUnfolderBase]: 8085/16876 cut-off events. [2023-11-29 06:43:10,506 INFO L125 PetriNetUnfolderBase]: For 8543/8622 co-relation queries the response was YES. [2023-11-29 06:43:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34655 conditions, 16876 events. 8085/16876 cut-off events. For 8543/8622 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 165866 event pairs, 2445 based on Foata normal form. 228/16291 useless extension candidates. Maximal degree in co-relation 28690. Up to 5182 conditions per place. [2023-11-29 06:43:10,669 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 61 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2023-11-29 06:43:10,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 144 transitions, 634 flow [2023-11-29 06:43:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:43:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 06:43:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 298 transitions. [2023-11-29 06:43:10,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8370786516853933 [2023-11-29 06:43:10,672 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 298 transitions. [2023-11-29 06:43:10,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 298 transitions. [2023-11-29 06:43:10,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:10,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 298 transitions. [2023-11-29 06:43:10,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:10,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:10,675 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:10,675 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 365 flow. Second operand 4 states and 298 transitions. [2023-11-29 06:43:10,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 144 transitions, 634 flow [2023-11-29 06:43:10,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 144 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:43:10,715 INFO L231 Difference]: Finished difference. Result has 92 places, 110 transitions, 440 flow [2023-11-29 06:43:10,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=92, PETRI_TRANSITIONS=110} [2023-11-29 06:43:10,716 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -1 predicate places. [2023-11-29 06:43:10,716 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 110 transitions, 440 flow [2023-11-29 06:43:10,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:10,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:10,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:10,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 06:43:10,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:10,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:10,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 936321885, now seen corresponding path program 1 times [2023-11-29 06:43:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890764856] [2023-11-29 06:43:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:10,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:10,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:10,919 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:10,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 06:43:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:10,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:43:10,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:11,049 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-29 06:43:11,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:11,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:11,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890764856] [2023-11-29 06:43:11,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890764856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:11,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:11,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:43:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129146653] [2023-11-29 06:43:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:11,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:43:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:43:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:43:11,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:43:11,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 110 transitions, 440 flow. Second operand has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:11,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:11,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:43:11,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:14,953 INFO L124 PetriNetUnfolderBase]: 22907/40347 cut-off events. [2023-11-29 06:43:14,953 INFO L125 PetriNetUnfolderBase]: For 27709/27839 co-relation queries the response was YES. [2023-11-29 06:43:15,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93935 conditions, 40347 events. 22907/40347 cut-off events. For 27709/27839 co-relation queries the response was YES. Maximal size of possible extension queue 2308. Compared 379696 event pairs, 6054 based on Foata normal form. 559/39843 useless extension candidates. Maximal degree in co-relation 84908. Up to 13776 conditions per place. [2023-11-29 06:43:15,237 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 229 selfloop transitions, 32 changer transitions 0/292 dead transitions. [2023-11-29 06:43:15,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 292 transitions, 1666 flow [2023-11-29 06:43:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:43:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 06:43:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 740 transitions. [2023-11-29 06:43:15,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7558733401430031 [2023-11-29 06:43:15,241 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 740 transitions. [2023-11-29 06:43:15,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 740 transitions. [2023-11-29 06:43:15,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:15,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 740 transitions. [2023-11-29 06:43:15,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 67.27272727272727) internal successors, (740), 11 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:15,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:15,247 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:15,247 INFO L175 Difference]: Start difference. First operand has 92 places, 110 transitions, 440 flow. Second operand 11 states and 740 transitions. [2023-11-29 06:43:15,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 292 transitions, 1666 flow [2023-11-29 06:43:15,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 292 transitions, 1648 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-11-29 06:43:15,607 INFO L231 Difference]: Finished difference. Result has 108 places, 122 transitions, 588 flow [2023-11-29 06:43:15,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=588, PETRI_PLACES=108, PETRI_TRANSITIONS=122} [2023-11-29 06:43:15,608 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 15 predicate places. [2023-11-29 06:43:15,608 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 122 transitions, 588 flow [2023-11-29 06:43:15,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:15,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:15,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:15,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 06:43:15,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:15,811 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:15,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash -904028799, now seen corresponding path program 1 times [2023-11-29 06:43:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866791657] [2023-11-29 06:43:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:15,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:15,813 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:15,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 06:43:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:15,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:43:15,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:43:15,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:15,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866791657] [2023-11-29 06:43:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866791657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:15,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:15,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071804174] [2023-11-29 06:43:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:15,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:43:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:43:15,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:43:16,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:43:16,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 122 transitions, 588 flow. Second operand has 7 states, 7 states have (on average 51.142857142857146) internal successors, (358), 7 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:16,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:16,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:43:16,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:21,561 INFO L124 PetriNetUnfolderBase]: 34994/59993 cut-off events. [2023-11-29 06:43:21,561 INFO L125 PetriNetUnfolderBase]: For 73645/75514 co-relation queries the response was YES. [2023-11-29 06:43:21,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148561 conditions, 59993 events. 34994/59993 cut-off events. For 73645/75514 co-relation queries the response was YES. Maximal size of possible extension queue 3265. Compared 572846 event pairs, 17601 based on Foata normal form. 1053/58126 useless extension candidates. Maximal degree in co-relation 127983. Up to 35493 conditions per place. [2023-11-29 06:43:21,990 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 158 selfloop transitions, 107 changer transitions 0/311 dead transitions. [2023-11-29 06:43:21,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 311 transitions, 2102 flow [2023-11-29 06:43:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:43:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 06:43:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 806 transitions. [2023-11-29 06:43:21,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2023-11-29 06:43:21,994 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 806 transitions. [2023-11-29 06:43:21,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 806 transitions. [2023-11-29 06:43:21,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:21,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 806 transitions. [2023-11-29 06:43:21,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 62.0) internal successors, (806), 13 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:22,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:22,001 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 89.0) internal successors, (1246), 14 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:22,001 INFO L175 Difference]: Start difference. First operand has 108 places, 122 transitions, 588 flow. Second operand 13 states and 806 transitions. [2023-11-29 06:43:22,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 311 transitions, 2102 flow [2023-11-29 06:43:23,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 311 transitions, 2000 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-11-29 06:43:23,127 INFO L231 Difference]: Finished difference. Result has 127 places, 205 transitions, 1390 flow [2023-11-29 06:43:23,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1390, PETRI_PLACES=127, PETRI_TRANSITIONS=205} [2023-11-29 06:43:23,128 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 34 predicate places. [2023-11-29 06:43:23,128 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 205 transitions, 1390 flow [2023-11-29 06:43:23,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.142857142857146) internal successors, (358), 7 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:23,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:23,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:23,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 06:43:23,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:23,329 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:23,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1581324611, now seen corresponding path program 1 times [2023-11-29 06:43:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476239978] [2023-11-29 06:43:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:23,331 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:23,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 06:43:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:23,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:43:23,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:23,462 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-29 06:43:23,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:23,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:23,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476239978] [2023-11-29 06:43:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476239978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:23,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:43:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575218354] [2023-11-29 06:43:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:23,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:43:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:43:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:43:23,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:43:23,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 205 transitions, 1390 flow. Second operand has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:23,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:23,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:43:23,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:33,884 INFO L124 PetriNetUnfolderBase]: 54096/92969 cut-off events. [2023-11-29 06:43:33,884 INFO L125 PetriNetUnfolderBase]: For 131220/133449 co-relation queries the response was YES. [2023-11-29 06:43:34,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246854 conditions, 92969 events. 54096/92969 cut-off events. For 131220/133449 co-relation queries the response was YES. Maximal size of possible extension queue 5397. Compared 952228 event pairs, 17275 based on Foata normal form. 2619/93212 useless extension candidates. Maximal degree in co-relation 229574. Up to 39138 conditions per place. [2023-11-29 06:43:34,740 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 243 selfloop transitions, 110 changer transitions 0/399 dead transitions. [2023-11-29 06:43:34,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 399 transitions, 3000 flow [2023-11-29 06:43:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:43:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 06:43:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 732 transitions. [2023-11-29 06:43:34,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7477017364657814 [2023-11-29 06:43:34,744 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 732 transitions. [2023-11-29 06:43:34,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 732 transitions. [2023-11-29 06:43:34,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:34,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 732 transitions. [2023-11-29 06:43:34,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 66.54545454545455) internal successors, (732), 11 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:34,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:34,749 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:34,749 INFO L175 Difference]: Start difference. First operand has 127 places, 205 transitions, 1390 flow. Second operand 11 states and 732 transitions. [2023-11-29 06:43:34,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 399 transitions, 3000 flow [2023-11-29 06:43:39,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 399 transitions, 2994 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-29 06:43:39,555 INFO L231 Difference]: Finished difference. Result has 143 places, 228 transitions, 1828 flow [2023-11-29 06:43:39,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1828, PETRI_PLACES=143, PETRI_TRANSITIONS=228} [2023-11-29 06:43:39,556 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 50 predicate places. [2023-11-29 06:43:39,556 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 228 transitions, 1828 flow [2023-11-29 06:43:39,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:39,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:43:39,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:39,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 06:43:39,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:39,757 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:43:39,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2102010035, now seen corresponding path program 1 times [2023-11-29 06:43:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:39,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948945578] [2023-11-29 06:43:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:39,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:39,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 06:43:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:43:39,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:39,897 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-29 06:43:39,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:39,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948945578] [2023-11-29 06:43:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948945578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:39,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308114729] [2023-11-29 06:43:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:39,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:43:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:43:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:43:39,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:43:39,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 228 transitions, 1828 flow. Second operand has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:39,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:43:39,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:43:39,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:43:52,257 INFO L124 PetriNetUnfolderBase]: 58995/103170 cut-off events. [2023-11-29 06:43:52,257 INFO L125 PetriNetUnfolderBase]: For 178360/179624 co-relation queries the response was YES. [2023-11-29 06:43:52,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291916 conditions, 103170 events. 58995/103170 cut-off events. For 178360/179624 co-relation queries the response was YES. Maximal size of possible extension queue 5896. Compared 1089567 event pairs, 32676 based on Foata normal form. 1376/102380 useless extension candidates. Maximal degree in co-relation 265360. Up to 73038 conditions per place. [2023-11-29 06:43:53,447 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 166 selfloop transitions, 134 changer transitions 0/346 dead transitions. [2023-11-29 06:43:53,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 346 transitions, 3085 flow [2023-11-29 06:43:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:43:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 06:43:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 689 transitions. [2023-11-29 06:43:53,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037793667007151 [2023-11-29 06:43:53,450 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 689 transitions. [2023-11-29 06:43:53,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 689 transitions. [2023-11-29 06:43:53,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:43:53,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 689 transitions. [2023-11-29 06:43:53,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 62.63636363636363) internal successors, (689), 11 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:53,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:53,455 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:43:53,455 INFO L175 Difference]: Start difference. First operand has 143 places, 228 transitions, 1828 flow. Second operand 11 states and 689 transitions. [2023-11-29 06:43:53,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 346 transitions, 3085 flow [2023-11-29 06:44:03,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 346 transitions, 2918 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-11-29 06:44:03,445 INFO L231 Difference]: Finished difference. Result has 154 places, 258 transitions, 2279 flow [2023-11-29 06:44:03,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2279, PETRI_PLACES=154, PETRI_TRANSITIONS=258} [2023-11-29 06:44:03,446 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 61 predicate places. [2023-11-29 06:44:03,446 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 258 transitions, 2279 flow [2023-11-29 06:44:03,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:03,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:03,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:03,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 06:44:03,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:03,647 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:44:03,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:03,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1406987701, now seen corresponding path program 1 times [2023-11-29 06:44:03,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:03,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452186011] [2023-11-29 06:44:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:03,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:03,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:03,649 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:03,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 06:44:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:03,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:44:03,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:03,809 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-29 06:44:03,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:44:03,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:44:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452186011] [2023-11-29 06:44:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452186011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:03,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:03,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:44:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062103965] [2023-11-29 06:44:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:03,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:44:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:44:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:44:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:44:03,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:44:03,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 258 transitions, 2279 flow. Second operand has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:03,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:03,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:44:03,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:18,404 INFO L124 PetriNetUnfolderBase]: 62411/109237 cut-off events. [2023-11-29 06:44:18,404 INFO L125 PetriNetUnfolderBase]: For 223823/225412 co-relation queries the response was YES. [2023-11-29 06:44:19,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309264 conditions, 109237 events. 62411/109237 cut-off events. For 223823/225412 co-relation queries the response was YES. Maximal size of possible extension queue 6316. Compared 1163931 event pairs, 34320 based on Foata normal form. 1541/108674 useless extension candidates. Maximal degree in co-relation 285715. Up to 78324 conditions per place. [2023-11-29 06:44:19,531 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 167 selfloop transitions, 158 changer transitions 0/377 dead transitions. [2023-11-29 06:44:19,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 377 transitions, 3612 flow [2023-11-29 06:44:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:44:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 06:44:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 688 transitions. [2023-11-29 06:44:19,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7027579162410623 [2023-11-29 06:44:19,534 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 688 transitions. [2023-11-29 06:44:19,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 688 transitions. [2023-11-29 06:44:19,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:19,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 688 transitions. [2023-11-29 06:44:19,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 62.54545454545455) internal successors, (688), 11 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:19,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:19,539 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:19,539 INFO L175 Difference]: Start difference. First operand has 154 places, 258 transitions, 2279 flow. Second operand 11 states and 688 transitions. [2023-11-29 06:44:19,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 377 transitions, 3612 flow [2023-11-29 06:44:27,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 377 transitions, 3477 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-11-29 06:44:27,850 INFO L231 Difference]: Finished difference. Result has 163 places, 288 transitions, 2834 flow [2023-11-29 06:44:27,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2834, PETRI_PLACES=163, PETRI_TRANSITIONS=288} [2023-11-29 06:44:27,850 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 70 predicate places. [2023-11-29 06:44:27,850 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 288 transitions, 2834 flow [2023-11-29 06:44:27,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:27,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:27,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:27,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 06:44:28,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:28,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:44:28,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash -286770684, now seen corresponding path program 1 times [2023-11-29 06:44:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102335189] [2023-11-29 06:44:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:28,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:28,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:28,053 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:28,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 06:44:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:28,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:44:28,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:28,157 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-29 06:44:28,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:44:28,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:44:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102335189] [2023-11-29 06:44:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102335189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:28,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:28,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:44:28,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444784851] [2023-11-29 06:44:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:28,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:44:28,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:44:28,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:44:28,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:44:28,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 89 [2023-11-29 06:44:28,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 288 transitions, 2834 flow. Second operand has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:28,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:28,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 89 [2023-11-29 06:44:28,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:31,107 INFO L124 PetriNetUnfolderBase]: 11862/25373 cut-off events. [2023-11-29 06:44:31,107 INFO L125 PetriNetUnfolderBase]: For 42238/43633 co-relation queries the response was YES. [2023-11-29 06:44:31,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64765 conditions, 25373 events. 11862/25373 cut-off events. For 42238/43633 co-relation queries the response was YES. Maximal size of possible extension queue 1667. Compared 265501 event pairs, 4263 based on Foata normal form. 574/25261 useless extension candidates. Maximal degree in co-relation 61299. Up to 8628 conditions per place. [2023-11-29 06:44:31,333 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 65 selfloop transitions, 13 changer transitions 0/239 dead transitions. [2023-11-29 06:44:31,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 239 transitions, 1976 flow [2023-11-29 06:44:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:44:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:44:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2023-11-29 06:44:31,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8089887640449438 [2023-11-29 06:44:31,335 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 360 transitions. [2023-11-29 06:44:31,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 360 transitions. [2023-11-29 06:44:31,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:31,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 360 transitions. [2023-11-29 06:44:31,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:31,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:31,338 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:31,338 INFO L175 Difference]: Start difference. First operand has 163 places, 288 transitions, 2834 flow. Second operand 5 states and 360 transitions. [2023-11-29 06:44:31,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 239 transitions, 1976 flow [2023-11-29 06:44:31,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 239 transitions, 1897 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-29 06:44:31,784 INFO L231 Difference]: Finished difference. Result has 164 places, 201 transitions, 1623 flow [2023-11-29 06:44:31,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1623, PETRI_PLACES=164, PETRI_TRANSITIONS=201} [2023-11-29 06:44:31,784 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 71 predicate places. [2023-11-29 06:44:31,784 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 201 transitions, 1623 flow [2023-11-29 06:44:31,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:31,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:31,785 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-29 06:44:31,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-29 06:44:31,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:31,985 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:44:31,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -374806405, now seen corresponding path program 1 times [2023-11-29 06:44:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:31,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108197152] [2023-11-29 06:44:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:31,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:31,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:31,987 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:31,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 06:44:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:32,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:44:32,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:32,144 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-29 06:44:32,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:44:32,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:44:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108197152] [2023-11-29 06:44:32,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108197152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:32,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:44:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790772029] [2023-11-29 06:44:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:32,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:44:32,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:44:32,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:44:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:44:32,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:44:32,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 201 transitions, 1623 flow. Second operand has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:32,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:32,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:44:32,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:37,009 INFO L124 PetriNetUnfolderBase]: 22241/39660 cut-off events. [2023-11-29 06:44:37,009 INFO L125 PetriNetUnfolderBase]: For 59546/60122 co-relation queries the response was YES. [2023-11-29 06:44:37,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108129 conditions, 39660 events. 22241/39660 cut-off events. For 59546/60122 co-relation queries the response was YES. Maximal size of possible extension queue 2119. Compared 366149 event pairs, 7882 based on Foata normal form. 339/39507 useless extension candidates. Maximal degree in co-relation 104462. Up to 20907 conditions per place. [2023-11-29 06:44:37,365 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 198 selfloop transitions, 79 changer transitions 0/331 dead transitions. [2023-11-29 06:44:37,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 331 transitions, 2737 flow [2023-11-29 06:44:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:44:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 06:44:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 653 transitions. [2023-11-29 06:44:37,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7337078651685394 [2023-11-29 06:44:37,368 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 653 transitions. [2023-11-29 06:44:37,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 653 transitions. [2023-11-29 06:44:37,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:37,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 653 transitions. [2023-11-29 06:44:37,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 65.3) internal successors, (653), 10 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:37,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:37,373 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:37,373 INFO L175 Difference]: Start difference. First operand has 164 places, 201 transitions, 1623 flow. Second operand 10 states and 653 transitions. [2023-11-29 06:44:37,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 331 transitions, 2737 flow [2023-11-29 06:44:38,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 331 transitions, 2695 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-29 06:44:38,127 INFO L231 Difference]: Finished difference. Result has 173 places, 207 transitions, 1814 flow [2023-11-29 06:44:38,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1814, PETRI_PLACES=173, PETRI_TRANSITIONS=207} [2023-11-29 06:44:38,128 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 80 predicate places. [2023-11-29 06:44:38,128 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 207 transitions, 1814 flow [2023-11-29 06:44:38,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:38,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:38,129 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-29 06:44:38,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 06:44:38,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:38,329 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:44:38,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1127900299, now seen corresponding path program 1 times [2023-11-29 06:44:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895012158] [2023-11-29 06:44:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:38,331 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:38,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 06:44:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:38,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:44:38,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:38,460 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-29 06:44:38,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:44:38,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:44:38,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895012158] [2023-11-29 06:44:38,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895012158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:38,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:38,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:44:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237338410] [2023-11-29 06:44:38,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:38,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:44:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:44:38,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:44:38,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:44:38,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 89 [2023-11-29 06:44:38,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 207 transitions, 1814 flow. Second operand has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:38,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:38,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 89 [2023-11-29 06:44:38,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:43,370 INFO L124 PetriNetUnfolderBase]: 21681/38954 cut-off events. [2023-11-29 06:44:43,370 INFO L125 PetriNetUnfolderBase]: For 68297/68761 co-relation queries the response was YES. [2023-11-29 06:44:43,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106517 conditions, 38954 events. 21681/38954 cut-off events. For 68297/68761 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 361423 event pairs, 7456 based on Foata normal form. 487/39084 useless extension candidates. Maximal degree in co-relation 103669. Up to 20562 conditions per place. [2023-11-29 06:44:43,733 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 200 selfloop transitions, 78 changer transitions 0/338 dead transitions. [2023-11-29 06:44:43,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 338 transitions, 2889 flow [2023-11-29 06:44:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:44:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 06:44:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 660 transitions. [2023-11-29 06:44:43,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7415730337078652 [2023-11-29 06:44:43,735 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 660 transitions. [2023-11-29 06:44:43,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 660 transitions. [2023-11-29 06:44:43,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:43,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 660 transitions. [2023-11-29 06:44:43,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:43,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:43,738 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 89.0) internal successors, (979), 11 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:43,738 INFO L175 Difference]: Start difference. First operand has 173 places, 207 transitions, 1814 flow. Second operand 10 states and 660 transitions. [2023-11-29 06:44:43,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 338 transitions, 2889 flow [2023-11-29 06:44:44,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 338 transitions, 2790 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-29 06:44:44,853 INFO L231 Difference]: Finished difference. Result has 180 places, 213 transitions, 1929 flow [2023-11-29 06:44:44,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1929, PETRI_PLACES=180, PETRI_TRANSITIONS=213} [2023-11-29 06:44:44,853 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 87 predicate places. [2023-11-29 06:44:44,854 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 213 transitions, 1929 flow [2023-11-29 06:44:44,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:44,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:44,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:44,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 06:44:45,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:45,055 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:44:45,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:45,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1317272850, now seen corresponding path program 1 times [2023-11-29 06:44:45,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:45,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115463264] [2023-11-29 06:44:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:45,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:45,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:45,056 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:45,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 06:44:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:45,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:44:45,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:45,190 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-29 06:44:45,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:44:45,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:44:45,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115463264] [2023-11-29 06:44:45,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115463264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:44:45,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:44:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:44:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630557415] [2023-11-29 06:44:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:45,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:44:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:44:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:44:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:44:45,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2023-11-29 06:44:45,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 213 transitions, 1929 flow. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:45,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:44:45,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2023-11-29 06:44:45,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:44:49,497 INFO L124 PetriNetUnfolderBase]: 16748/33967 cut-off events. [2023-11-29 06:44:49,497 INFO L125 PetriNetUnfolderBase]: For 67142/68759 co-relation queries the response was YES. [2023-11-29 06:44:49,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91635 conditions, 33967 events. 16748/33967 cut-off events. For 67142/68759 co-relation queries the response was YES. Maximal size of possible extension queue 2099. Compared 353757 event pairs, 5211 based on Foata normal form. 717/33896 useless extension candidates. Maximal degree in co-relation 88987. Up to 9414 conditions per place. [2023-11-29 06:44:49,814 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 122 selfloop transitions, 24 changer transitions 0/304 dead transitions. [2023-11-29 06:44:49,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 304 transitions, 2599 flow [2023-11-29 06:44:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:44:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 06:44:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 495 transitions. [2023-11-29 06:44:49,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7945425361155698 [2023-11-29 06:44:49,816 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 495 transitions. [2023-11-29 06:44:49,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 495 transitions. [2023-11-29 06:44:49,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:44:49,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 495 transitions. [2023-11-29 06:44:49,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.71428571428571) internal successors, (495), 7 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:49,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:49,820 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:49,820 INFO L175 Difference]: Start difference. First operand has 180 places, 213 transitions, 1929 flow. Second operand 7 states and 495 transitions. [2023-11-29 06:44:49,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 304 transitions, 2599 flow [2023-11-29 06:44:50,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 304 transitions, 2488 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-29 06:44:50,432 INFO L231 Difference]: Finished difference. Result has 185 places, 228 transitions, 2012 flow [2023-11-29 06:44:50,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2012, PETRI_PLACES=185, PETRI_TRANSITIONS=228} [2023-11-29 06:44:50,432 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 92 predicate places. [2023-11-29 06:44:50,433 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 228 transitions, 2012 flow [2023-11-29 06:44:50,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:44:50,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:44:50,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:50,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 06:44:50,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:50,633 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-29 06:44:50,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 612959910, now seen corresponding path program 2 times [2023-11-29 06:44:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:50,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431944066] [2023-11-29 06:44:50,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:44:50,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:50,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:50,635 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:50,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 06:44:50,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 06:44:50,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 06:44:50,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:44:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:44:50,847 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 06:44:50,847 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:44:50,848 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-11-29 06:44:50,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-11-29 06:44:50,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-11-29 06:44:50,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-11-29 06:44:50,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-11-29 06:44:50,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-11-29 06:44:50,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-11-29 06:44:50,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-11-29 06:44:50,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-11-29 06:44:50,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 06:44:51,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:51,053 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:44:51,058 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 06:44:51,058 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:44:51,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2023-11-29 06:44:51,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-29 06:44:51,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated [2023-11-29 06:44:51,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-29 06:44:51,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:44:51 BasicIcfg [2023-11-29 06:44:51,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:44:51,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:44:51,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:44:51,105 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:44:51,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:54" (3/4) ... [2023-11-29 06:44:51,108 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:44:51,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:44:51,109 INFO L158 Benchmark]: Toolchain (without parser) took 117507.55ms. Allocated memory was 73.4MB in the beginning and 11.4GB in the end (delta: 11.4GB). Free memory was 48.8MB in the beginning and 5.8GB in the end (delta: -5.8GB). Peak memory consumption was 5.6GB. Max. memory is 16.1GB. [2023-11-29 06:44:51,109 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 52.4MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:44:51,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.76ms. Allocated memory is still 73.4MB. Free memory was 48.6MB in the beginning and 47.3MB in the end (delta: 1.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-11-29 06:44:51,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.70ms. Allocated memory is still 73.4MB. Free memory was 47.3MB in the beginning and 44.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:44:51,110 INFO L158 Benchmark]: Boogie Preprocessor took 57.18ms. Allocated memory is still 73.4MB. Free memory was 44.9MB in the beginning and 42.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:44:51,110 INFO L158 Benchmark]: RCFGBuilder took 690.75ms. Allocated memory is still 73.4MB. Free memory was 42.0MB in the beginning and 45.2MB in the end (delta: -3.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-11-29 06:44:51,111 INFO L158 Benchmark]: TraceAbstraction took 116157.52ms. Allocated memory was 73.4MB in the beginning and 11.4GB in the end (delta: 11.4GB). Free memory was 44.8MB in the beginning and 5.8GB in the end (delta: -5.8GB). Peak memory consumption was 5.6GB. Max. memory is 16.1GB. [2023-11-29 06:44:51,111 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 11.4GB. Free memory is still 5.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:44:51,113 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.32ms. Allocated memory is still 52.4MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.76ms. Allocated memory is still 73.4MB. Free memory was 48.6MB in the beginning and 47.3MB in the end (delta: 1.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.70ms. Allocated memory is still 73.4MB. Free memory was 47.3MB in the beginning and 44.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.18ms. Allocated memory is still 73.4MB. Free memory was 44.9MB in the beginning and 42.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 690.75ms. Allocated memory is still 73.4MB. Free memory was 42.0MB in the beginning and 45.2MB in the end (delta: -3.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 116157.52ms. Allocated memory was 73.4MB in the beginning and 11.4GB in the end (delta: 11.4GB). Free memory was 44.8MB in the beginning and 5.8GB in the end (delta: -5.8GB). Peak memory consumption was 5.6GB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 11.4GB. Free memory is still 5.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1={6:0}, t2={7:0}, t3={3:0}, t4={-2147483645:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1={6:0}, t2={7:0}, t3={3:0}, t4={-2147483645:0}, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1={6:0}, t2={7:0}, t3={3:0}, t4={-2147483645:0}, w=0, x=0, y=0] [L724] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=0, t1={6:0}, t2={7:0}, t3={3:0}, t4={-2147483645:0}, w=0, x=0, y=0] [L724] 4 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L733] 4 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 111 locations, 24 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: 116.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 105.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2213 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1779 mSDsluCounter, 699 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4478 IncrementalHoareTripleChecker+Invalid, 4567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 208 mSDtfsCounter, 4478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2834occurred in iteration=16, InterpolantAutomatonStates: 133, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 315 ConstructedInterpolants, 24 QuantifiedInterpolants, 2299 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1815 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 06:44:51,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_deda5d3d-3b46-4dbd-a8ed-fce4c35d9229/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample