./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-11-26 12:04:54,199 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-26 12:04:54,296 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-11-26 12:04:54,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-26 12:04:54,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-26 12:04:54,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-26 12:04:54,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-26 12:04:54,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-26 12:04:54,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-26 12:04:54,339 INFO L153 SettingsManager]: * Use memory slicer=true
[2023-11-26 12:04:54,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-26 12:04:54,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-26 12:04:54,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-26 12:04:54,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-26 12:04:54,343 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-26 12:04:54,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-26 12:04:54,344 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-26 12:04:54,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-26 12:04:54,345 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-26 12:04:54,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-26 12:04:54,346 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-11-26 12:04:54,346 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2023-11-26 12:04:54,347 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-11-26 12:04:54,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-26 12:04:54,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-26 12:04:54,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-26 12:04:54,349 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-26 12:04:54,349 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-26 12:04:54,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-26 12:04:54,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-26 12:04:54,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-26 12:04:54,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-26 12:04:54,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 12:04:54,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-26 12:04:54,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-26 12:04:54,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-26 12:04:54,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-26 12:04:54,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-26 12:04:54,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-26 12:04:54,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-26 12:04:54,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-26 12:04:54,355 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_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da
[2023-11-26 12:04:54,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-26 12:04:54,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-26 12:04:54,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-26 12:04:54,718 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-26 12:04:54,719 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-26 12:04:54,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i
[2023-11-26 12:04:57,906 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-26 12:04:58,267 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-26 12:04:58,268 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i
[2023-11-26 12:04:58,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/data/8831a003e/48807b0bd29041e2824e2b9e3224bbef/FLAGf65f40447
[2023-11-26 12:04:58,305 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/data/8831a003e/48807b0bd29041e2824e2b9e3224bbef
[2023-11-26 12:04:58,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-26 12:04:58,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-26 12:04:58,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-26 12:04:58,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-26 12:04:58,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-26 12:04:58,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:58,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35973a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58, skipping insertion in model container
[2023-11-26 12:04:58,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:58,375 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-26 12:04:58,817 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 12:04:58,831 INFO L202 MainTranslator]: Completed pre-run
[2023-11-26 12:04:58,905 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 12:04:58,969 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-26 12:04:58,969 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-26 12:04:58,978 INFO L206 MainTranslator]: Completed translation
[2023-11-26 12:04:58,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58 WrapperNode
[2023-11-26 12:04:58,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-26 12:04:58,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-26 12:04:58,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-26 12:04:58,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-26 12:04:58,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,087 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 187
[2023-11-26 12:04:59,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-26 12:04:59,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-26 12:04:59,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-26 12:04:59,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-26 12:04:59,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,156 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [2, 1, 16, 1, 1]. 76 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 8 writes are split as follows [0, 1, 5, 1, 1].
[2023-11-26 12:04:59,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-26 12:04:59,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-26 12:04:59,213 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-26 12:04:59,213 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-26 12:04:59,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (1/1) ...
[2023-11-26 12:04:59,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 12:04:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 12:04:59,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2023-11-26 12:04:59,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2023-11-26 12:04:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2023-11-26 12:04:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2023-11-26 12:04:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2
[2023-11-26 12:04:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3
[2023-11-26 12:04:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4
[2023-11-26 12:04:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2023-11-26 12:04:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2023-11-26 12:04:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2023-11-26 12:04:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3
[2023-11-26 12:04:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4
[2023-11-26 12:04:59,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-26 12:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-26 12:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-26 12:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-26 12:04:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-26 12:04:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-26 12:04:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-26 12:04:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-26 12:04:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-26 12:04:59,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-26 12:04:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-11-26 12:04:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2023-11-26 12:04:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2
[2023-11-26 12:04:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3
[2023-11-26 12:04:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4
[2023-11-26 12:04:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-26 12:04:59,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-26 12:04:59,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-26 12:04:59,317 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-26 12:04:59,578 INFO L241 CfgBuilder]: Building ICFG
[2023-11-26 12:04:59,581 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-26 12:05:00,232 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-26 12:05:00,872 WARN L1821 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs.
[2023-11-26 12:05:01,037 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-26 12:05:01,038 INFO L309 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-26 12:05:01,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:01 BoogieIcfgContainer
[2023-11-26 12:05:01,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-26 12:05:01,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-26 12:05:01,043 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-26 12:05:01,047 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-26 12:05:01,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:04:58" (1/3) ...
[2023-11-26 12:05:01,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65db33e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:01, skipping insertion in model container
[2023-11-26 12:05:01,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:58" (2/3) ...
[2023-11-26 12:05:01,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65db33e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:01, skipping insertion in model container
[2023-11-26 12:05:01,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:01" (3/3) ...
[2023-11-26 12:05:01,052 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i
[2023-11-26 12:05:01,073 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-26 12:05:01,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations.
[2023-11-26 12:05:01,073 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-26 12:05:01,259 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-26 12:05:01,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 110 transitions, 232 flow
[2023-11-26 12:05:01,365 INFO L124 PetriNetUnfolderBase]: 29/107 cut-off events.
[2023-11-26 12:05:01,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 12:05:01,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 29/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 310 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 106. Up to 4 conditions per place.
[2023-11-26 12:05:01,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 110 transitions, 232 flow
[2023-11-26 12:05:01,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 107 transitions, 223 flow
[2023-11-26 12:05:01,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-26 12:05:01,407 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;@7e6cdc0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-26 12:05:01,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations.
[2023-11-26 12:05:01,413 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-26 12:05:01,414 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events.
[2023-11-26 12:05:01,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 12:05:01,414 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:01,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-26 12:05:01,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:01,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash 28312, now seen corresponding path program 1 times
[2023-11-26 12:05:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93237918]
[2023-11-26 12:05:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:01,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:01,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93237918]
[2023-11-26 12:05:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93237918] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:01,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:01,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-26 12:05:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911955172]
[2023-11-26 12:05:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:01,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:01,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:01,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110
[2023-11-26 12:05:01,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:01,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:01,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110
[2023-11-26 12:05:01,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:04,870 INFO L124 PetriNetUnfolderBase]: 6863/10581 cut-off events.
[2023-11-26 12:05:04,871 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES.
[2023-11-26 12:05:04,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20233 conditions, 10581 events. 6863/10581 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 87971 event pairs, 5229 based on Foata normal form. 360/5822 useless extension candidates. Maximal degree in co-relation 20219. Up to 8313 conditions per place.
[2023-11-26 12:05:05,021 INFO L140 encePairwiseOnDemand]: 67/110 looper letters, 61 selfloop transitions, 2 changer transitions 0/86 dead transitions.
[2023-11-26 12:05:05,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 307 flow
[2023-11-26 12:05:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions.
[2023-11-26 12:05:05,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666
[2023-11-26 12:05:05,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 220 transitions.
[2023-11-26 12:05:05,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 220 transitions.
[2023-11-26 12:05:05,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:05,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 220 transitions.
[2023-11-26 12:05:05,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:05,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:05,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:05,063 INFO L175 Difference]: Start difference. First operand has 88 places, 107 transitions, 223 flow. Second operand 3 states and 220 transitions.
[2023-11-26 12:05:05,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 307 flow
[2023-11-26 12:05:05,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 304 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-26 12:05:05,076 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 140 flow
[2023-11-26 12:05:05,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=65}
[2023-11-26 12:05:05,084 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -17 predicate places.
[2023-11-26 12:05:05,084 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 140 flow
[2023-11-26 12:05:05,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:05,085 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:05,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-11-26 12:05:05,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-26 12:05:05,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:05,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash 28313, now seen corresponding path program 1 times
[2023-11-26 12:05:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:05,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801846817]
[2023-11-26 12:05:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801846817]
[2023-11-26 12:05:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801846817] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:05,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-26 12:05:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118605694]
[2023-11-26 12:05:05,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:05,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:05,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 110
[2023-11-26 12:05:05,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:05,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:05,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 110
[2023-11-26 12:05:05,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:07,763 INFO L124 PetriNetUnfolderBase]: 6863/10580 cut-off events.
[2023-11-26 12:05:07,764 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES.
[2023-11-26 12:05:07,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20410 conditions, 10580 events. 6863/10580 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 88043 event pairs, 5229 based on Foata normal form. 1/5462 useless extension candidates. Maximal degree in co-relation 20399. Up to 8312 conditions per place.
[2023-11-26 12:05:07,871 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/85 dead transitions.
[2023-11-26 12:05:07,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 304 flow
[2023-11-26 12:05:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions.
[2023-11-26 12:05:07,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634
[2023-11-26 12:05:07,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions.
[2023-11-26 12:05:07,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions.
[2023-11-26 12:05:07,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:07,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions.
[2023-11-26 12:05:07,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:07,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:07,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:07,891 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 140 flow. Second operand 3 states and 144 transitions.
[2023-11-26 12:05:07,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 304 flow
[2023-11-26 12:05:07,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:07,932 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 138 flow
[2023-11-26 12:05:07,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=138, PETRI_PLACES=70, PETRI_TRANSITIONS=64}
[2023-11-26 12:05:07,934 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -18 predicate places.
[2023-11-26 12:05:07,934 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 138 flow
[2023-11-26 12:05:07,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:07,935 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:07,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-26 12:05:07,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-26 12:05:07,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:07,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash 844362636, now seen corresponding path program 1 times
[2023-11-26 12:05:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133365796]
[2023-11-26 12:05:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133365796]
[2023-11-26 12:05:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133365796] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 12:05:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897800026]
[2023-11-26 12:05:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:08,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:08,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:08,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:08,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110
[2023-11-26 12:05:08,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:08,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:08,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110
[2023-11-26 12:05:08,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:10,291 INFO L124 PetriNetUnfolderBase]: 6864/10578 cut-off events.
[2023-11-26 12:05:10,291 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES.
[2023-11-26 12:05:10,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20411 conditions, 10578 events. 6864/10578 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 87806 event pairs, 5229 based on Foata normal form. 0/5463 useless extension candidates. Maximal degree in co-relation 20400. Up to 8312 conditions per place.
[2023-11-26 12:05:10,492 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 61 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-11-26 12:05:10,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 304 flow
[2023-11-26 12:05:10,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions.
[2023-11-26 12:05:10,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303
[2023-11-26 12:05:10,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 142 transitions.
[2023-11-26 12:05:10,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 142 transitions.
[2023-11-26 12:05:10,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:10,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 142 transitions.
[2023-11-26 12:05:10,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:10,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:10,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:10,500 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 138 flow. Second operand 3 states and 142 transitions.
[2023-11-26 12:05:10,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 304 flow
[2023-11-26 12:05:10,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:10,513 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 136 flow
[2023-11-26 12:05:10,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=63}
[2023-11-26 12:05:10,515 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -19 predicate places.
[2023-11-26 12:05:10,516 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 136 flow
[2023-11-26 12:05:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:10,516 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:10,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-26 12:05:10,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-26 12:05:10,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:10,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 844362637, now seen corresponding path program 1 times
[2023-11-26 12:05:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:10,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961328748]
[2023-11-26 12:05:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:10,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:10,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961328748]
[2023-11-26 12:05:10,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961328748] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:10,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:10,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 12:05:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866883162]
[2023-11-26 12:05:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:10,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:10,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 110
[2023-11-26 12:05:10,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:10,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:10,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 110
[2023-11-26 12:05:10,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:12,733 INFO L124 PetriNetUnfolderBase]: 6863/10576 cut-off events.
[2023-11-26 12:05:12,733 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES.
[2023-11-26 12:05:12,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20407 conditions, 10576 events. 6863/10576 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 87271 event pairs, 4220 based on Foata normal form. 2/5464 useless extension candidates. Maximal degree in co-relation 20397. Up to 8309 conditions per place.
[2023-11-26 12:05:12,808 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/83 dead transitions.
[2023-11-26 12:05:12,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 300 flow
[2023-11-26 12:05:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions.
[2023-11-26 12:05:12,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634
[2023-11-26 12:05:12,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions.
[2023-11-26 12:05:12,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions.
[2023-11-26 12:05:12,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:12,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions.
[2023-11-26 12:05:12,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:12,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:12,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:12,814 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 136 flow. Second operand 3 states and 144 transitions.
[2023-11-26 12:05:12,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 300 flow
[2023-11-26 12:05:12,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:12,821 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 134 flow
[2023-11-26 12:05:12,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=66, 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=134, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2023-11-26 12:05:12,823 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -20 predicate places.
[2023-11-26 12:05:12,823 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 134 flow
[2023-11-26 12:05:12,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:12,824 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:12,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:12,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-26 12:05:12,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:12,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1215242569, now seen corresponding path program 1 times
[2023-11-26 12:05:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:12,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759460721]
[2023-11-26 12:05:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:12,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:12,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:12,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759460721]
[2023-11-26 12:05:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759460721] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:12,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:12,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 12:05:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869784241]
[2023-11-26 12:05:12,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:12,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:12,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:12,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110
[2023-11-26 12:05:12,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:12,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:12,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110
[2023-11-26 12:05:12,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:14,439 INFO L124 PetriNetUnfolderBase]: 6888/10418 cut-off events.
[2023-11-26 12:05:14,439 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES.
[2023-11-26 12:05:14,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20292 conditions, 10418 events. 6888/10418 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 81275 event pairs, 5357 based on Foata normal form. 0/5253 useless extension candidates. Maximal degree in co-relation 20282. Up to 8322 conditions per place.
[2023-11-26 12:05:14,518 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 61 selfloop transitions, 2 changer transitions 0/82 dead transitions.
[2023-11-26 12:05:14,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 300 flow
[2023-11-26 12:05:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions.
[2023-11-26 12:05:14,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303
[2023-11-26 12:05:14,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 142 transitions.
[2023-11-26 12:05:14,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 142 transitions.
[2023-11-26 12:05:14,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:14,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 142 transitions.
[2023-11-26 12:05:14,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:14,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:14,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:14,524 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 134 flow. Second operand 3 states and 142 transitions.
[2023-11-26 12:05:14,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 300 flow
[2023-11-26 12:05:14,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:14,536 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 132 flow
[2023-11-26 12:05:14,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=61}
[2023-11-26 12:05:14,537 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places.
[2023-11-26 12:05:14,538 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 132 flow
[2023-11-26 12:05:14,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:14,538 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:14,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:14,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-26 12:05:14,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:14,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1215242568, now seen corresponding path program 1 times
[2023-11-26 12:05:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:14,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772349276]
[2023-11-26 12:05:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:14,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772349276]
[2023-11-26 12:05:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772349276] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 12:05:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273776379]
[2023-11-26 12:05:14,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:14,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:14,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:14,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:14,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 110
[2023-11-26 12:05:14,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:14,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:14,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 110
[2023-11-26 12:05:14,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:16,364 INFO L124 PetriNetUnfolderBase]: 6863/10370 cut-off events.
[2023-11-26 12:05:16,365 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES.
[2023-11-26 12:05:16,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20217 conditions, 10370 events. 6863/10370 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 80370 event pairs, 5332 based on Foata normal form. 18/5237 useless extension candidates. Maximal degree in co-relation 20207. Up to 8279 conditions per place.
[2023-11-26 12:05:16,436 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/81 dead transitions.
[2023-11-26 12:05:16,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 296 flow
[2023-11-26 12:05:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions.
[2023-11-26 12:05:16,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634
[2023-11-26 12:05:16,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions.
[2023-11-26 12:05:16,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions.
[2023-11-26 12:05:16,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:16,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions.
[2023-11-26 12:05:16,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:16,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:16,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:16,442 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 132 flow. Second operand 3 states and 144 transitions.
[2023-11-26 12:05:16,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 296 flow
[2023-11-26 12:05:16,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:16,453 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 130 flow
[2023-11-26 12:05:16,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=66, PETRI_TRANSITIONS=60}
[2023-11-26 12:05:16,454 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -22 predicate places.
[2023-11-26 12:05:16,455 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 130 flow
[2023-11-26 12:05:16,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:16,455 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:16,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:16,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-26 12:05:16,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:16,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash 982196809, now seen corresponding path program 1 times
[2023-11-26 12:05:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106255162]
[2023-11-26 12:05:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106255162]
[2023-11-26 12:05:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106255162] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-26 12:05:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738894606]
[2023-11-26 12:05:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:16,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:16,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110
[2023-11-26 12:05:16,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:16,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:16,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110
[2023-11-26 12:05:16,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:18,755 INFO L124 PetriNetUnfolderBase]: 9134/13983 cut-off events.
[2023-11-26 12:05:18,755 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES.
[2023-11-26 12:05:18,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27339 conditions, 13983 events. 9134/13983 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 123259 event pairs, 2512 based on Foata normal form. 0/7430 useless extension candidates. Maximal degree in co-relation 27329. Up to 7491 conditions per place.
[2023-11-26 12:05:18,872 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 69 selfloop transitions, 3 changer transitions 0/91 dead transitions.
[2023-11-26 12:05:18,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 342 flow
[2023-11-26 12:05:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions.
[2023-11-26 12:05:18,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486
[2023-11-26 12:05:18,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions.
[2023-11-26 12:05:18,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions.
[2023-11-26 12:05:18,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:18,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions.
[2023-11-26 12:05:18,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:18,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:18,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:18,879 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 130 flow. Second operand 3 states and 160 transitions.
[2023-11-26 12:05:18,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 342 flow
[2023-11-26 12:05:18,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:18,888 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 146 flow
[2023-11-26 12:05:18,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=67, PETRI_TRANSITIONS=60}
[2023-11-26 12:05:18,889 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places.
[2023-11-26 12:05:18,890 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 146 flow
[2023-11-26 12:05:18,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:18,890 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:18,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:18,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-26 12:05:18,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:18,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 383330935, now seen corresponding path program 1 times
[2023-11-26 12:05:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974400591]
[2023-11-26 12:05:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:18,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:19,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974400591]
[2023-11-26 12:05:19,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974400591] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:19,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:19,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 12:05:19,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642013052]
[2023-11-26 12:05:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:19,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:19,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:19,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110
[2023-11-26 12:05:19,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:19,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:19,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110
[2023-11-26 12:05:19,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:21,688 INFO L124 PetriNetUnfolderBase]: 9512/14885 cut-off events.
[2023-11-26 12:05:21,688 INFO L125 PetriNetUnfolderBase]: For 1738/1738 co-relation queries the response was YES.
[2023-11-26 12:05:21,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30140 conditions, 14885 events. 9512/14885 cut-off events. For 1738/1738 co-relation queries the response was YES. Maximal size of possible extension queue 1772. Compared 132092 event pairs, 5664 based on Foata normal form. 90/8718 useless extension candidates. Maximal degree in co-relation 30127. Up to 10822 conditions per place.
[2023-11-26 12:05:21,836 INFO L140 encePairwiseOnDemand]: 100/110 looper letters, 65 selfloop transitions, 7 changer transitions 0/91 dead transitions.
[2023-11-26 12:05:21,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 360 flow
[2023-11-26 12:05:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions.
[2023-11-26 12:05:21,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876
[2023-11-26 12:05:21,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions.
[2023-11-26 12:05:21,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions.
[2023-11-26 12:05:21,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:21,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions.
[2023-11-26 12:05:21,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:21,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:21,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:21,842 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 146 flow. Second operand 3 states and 158 transitions.
[2023-11-26 12:05:21,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 360 flow
[2023-11-26 12:05:21,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:21,848 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 197 flow
[2023-11-26 12:05:21,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=68, PETRI_TRANSITIONS=66}
[2023-11-26 12:05:21,849 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -20 predicate places.
[2023-11-26 12:05:21,849 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 197 flow
[2023-11-26 12:05:21,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:21,849 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:21,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:21,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-26 12:05:21,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:21,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash 383330937, now seen corresponding path program 1 times
[2023-11-26 12:05:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:21,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817117138]
[2023-11-26 12:05:21,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817117138]
[2023-11-26 12:05:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817117138] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:22,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-26 12:05:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948297851]
[2023-11-26 12:05:22,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:22,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-26 12:05:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:22,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-26 12:05:22,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-26 12:05:22,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110
[2023-11-26 12:05:22,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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-26 12:05:22,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:22,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110
[2023-11-26 12:05:22,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:23,498 INFO L124 PetriNetUnfolderBase]: 5568/9187 cut-off events.
[2023-11-26 12:05:23,498 INFO L125 PetriNetUnfolderBase]: For 2506/2514 co-relation queries the response was YES.
[2023-11-26 12:05:23,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21028 conditions, 9187 events. 5568/9187 cut-off events. For 2506/2514 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 79844 event pairs, 3212 based on Foata normal form. 0/7145 useless extension candidates. Maximal degree in co-relation 21015. Up to 5205 conditions per place.
[2023-11-26 12:05:23,551 INFO L140 encePairwiseOnDemand]: 95/110 looper letters, 71 selfloop transitions, 14 changer transitions 0/103 dead transitions.
[2023-11-26 12:05:23,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 524 flow
[2023-11-26 12:05:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-26 12:05:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-26 12:05:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions.
[2023-11-26 12:05:23,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42272727272727273
[2023-11-26 12:05:23,553 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 186 transitions.
[2023-11-26 12:05:23,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 186 transitions.
[2023-11-26 12:05:23,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:23,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 186 transitions.
[2023-11-26 12:05:23,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:23,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:23,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:23,556 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 197 flow. Second operand 4 states and 186 transitions.
[2023-11-26 12:05:23,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 524 flow
[2023-11-26 12:05:23,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-11-26 12:05:23,564 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 336 flow
[2023-11-26 12:05:23,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=71, PETRI_TRANSITIONS=76}
[2023-11-26 12:05:23,565 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -17 predicate places.
[2023-11-26 12:05:23,566 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 336 flow
[2023-11-26 12:05:23,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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-26 12:05:23,566 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:23,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:23,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-26 12:05:23,567 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:23,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash 383330938, now seen corresponding path program 1 times
[2023-11-26 12:05:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:23,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837588259]
[2023-11-26 12:05:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837588259]
[2023-11-26 12:05:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837588259] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:23,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:23,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 12:05:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549718885]
[2023-11-26 12:05:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:23,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 12:05:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:23,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 12:05:23,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2023-11-26 12:05:23,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110
[2023-11-26 12:05:23,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 336 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:23,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:23,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110
[2023-11-26 12:05:23,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:24,462 INFO L124 PetriNetUnfolderBase]: 2032/3525 cut-off events.
[2023-11-26 12:05:24,462 INFO L125 PetriNetUnfolderBase]: For 3018/3034 co-relation queries the response was YES.
[2023-11-26 12:05:24,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9994 conditions, 3525 events. 2032/3525 cut-off events. For 3018/3034 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 27815 event pairs, 1064 based on Foata normal form. 866/3900 useless extension candidates. Maximal degree in co-relation 9977. Up to 1645 conditions per place.
[2023-11-26 12:05:24,482 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 60 selfloop transitions, 2 changer transitions 0/81 dead transitions.
[2023-11-26 12:05:24,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 512 flow
[2023-11-26 12:05:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-26 12:05:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-26 12:05:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions.
[2023-11-26 12:05:24,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375
[2023-11-26 12:05:24,484 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 165 transitions.
[2023-11-26 12:05:24,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 165 transitions.
[2023-11-26 12:05:24,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:24,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 165 transitions.
[2023-11-26 12:05:24,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:24,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:24,487 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:24,487 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 336 flow. Second operand 4 states and 165 transitions.
[2023-11-26 12:05:24,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 512 flow
[2023-11-26 12:05:24,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 510 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-26 12:05:24,493 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 322 flow
[2023-11-26 12:05:24,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=69}
[2023-11-26 12:05:24,494 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -22 predicate places.
[2023-11-26 12:05:24,494 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 322 flow
[2023-11-26 12:05:24,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:24,494 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:24,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:24,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-26 12:05:24,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:24,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1580534122, now seen corresponding path program 1 times
[2023-11-26 12:05:24,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:24,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420411424]
[2023-11-26 12:05:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:24,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:24,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-26 12:05:24,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:24,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420411424]
[2023-11-26 12:05:24,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420411424] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:24,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-26 12:05:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420866388]
[2023-11-26 12:05:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:24,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 12:05:24,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:24,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 12:05:24,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 12:05:24,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110
[2023-11-26 12:05:24,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:24,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:24,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110
[2023-11-26 12:05:24,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:25,206 INFO L124 PetriNetUnfolderBase]: 1942/3375 cut-off events.
[2023-11-26 12:05:25,206 INFO L125 PetriNetUnfolderBase]: For 2604/2620 co-relation queries the response was YES.
[2023-11-26 12:05:25,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9593 conditions, 3375 events. 1942/3375 cut-off events. For 2604/2620 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 26343 event pairs, 497 based on Foata normal form. 0/2980 useless extension candidates. Maximal degree in co-relation 9575. Up to 2592 conditions per place.
[2023-11-26 12:05:25,226 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 51 selfloop transitions, 17 changer transitions 0/87 dead transitions.
[2023-11-26 12:05:25,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 537 flow
[2023-11-26 12:05:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 12:05:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 12:05:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions.
[2023-11-26 12:05:25,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396969696969697
[2023-11-26 12:05:25,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions.
[2023-11-26 12:05:25,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions.
[2023-11-26 12:05:25,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:25,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions.
[2023-11-26 12:05:25,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:25,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:25,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:25,230 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 322 flow. Second operand 3 states and 131 transitions.
[2023-11-26 12:05:25,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 537 flow
[2023-11-26 12:05:25,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 533 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:25,234 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 374 flow
[2023-11-26 12:05:25,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=67, PETRI_TRANSITIONS=69}
[2023-11-26 12:05:25,235 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places.
[2023-11-26 12:05:25,235 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 374 flow
[2023-11-26 12:05:25,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:25,236 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:25,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-26 12:05:25,236 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:25,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1525272357, now seen corresponding path program 1 times
[2023-11-26 12:05:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:25,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421294854]
[2023-11-26 12:05:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:25,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:25,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:25,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421294854]
[2023-11-26 12:05:25,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421294854] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:25,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:25,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 12:05:25,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19455582]
[2023-11-26 12:05:25,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:25,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-26 12:05:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:25,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-26 12:05:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-26 12:05:25,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110
[2023-11-26 12:05:25,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:25,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:25,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110
[2023-11-26 12:05:25,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:26,074 INFO L124 PetriNetUnfolderBase]: 1970/3519 cut-off events.
[2023-11-26 12:05:26,074 INFO L125 PetriNetUnfolderBase]: For 2760/2776 co-relation queries the response was YES.
[2023-11-26 12:05:26,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10574 conditions, 3519 events. 1970/3519 cut-off events. For 2760/2776 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 28157 event pairs, 397 based on Foata normal form. 0/3220 useless extension candidates. Maximal degree in co-relation 10555. Up to 1667 conditions per place.
[2023-11-26 12:05:26,096 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 47 selfloop transitions, 23 changer transitions 0/89 dead transitions.
[2023-11-26 12:05:26,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 580 flow
[2023-11-26 12:05:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-26 12:05:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-26 12:05:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions.
[2023-11-26 12:05:26,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183
[2023-11-26 12:05:26,098 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 168 transitions.
[2023-11-26 12:05:26,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 168 transitions.
[2023-11-26 12:05:26,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:26,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 168 transitions.
[2023-11-26 12:05:26,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,101 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,101 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 374 flow. Second operand 4 states and 168 transitions.
[2023-11-26 12:05:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 580 flow
[2023-11-26 12:05:26,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:26,106 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 388 flow
[2023-11-26 12:05:26,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=67, PETRI_TRANSITIONS=69}
[2023-11-26 12:05:26,107 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places.
[2023-11-26 12:05:26,107 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 388 flow
[2023-11-26 12:05:26,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,108 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:26,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:26,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-26 12:05:26,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:26,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1320409682, now seen corresponding path program 1 times
[2023-11-26 12:05:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201286404]
[2023-11-26 12:05:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:26,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:26,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:26,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201286404]
[2023-11-26 12:05:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201286404] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 12:05:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726763357]
[2023-11-26 12:05:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:26,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 12:05:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 12:05:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-26 12:05:26,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 110
[2023-11-26 12:05:26,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 388 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:26,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 110
[2023-11-26 12:05:26,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:26,969 INFO L124 PetriNetUnfolderBase]: 1878/3379 cut-off events.
[2023-11-26 12:05:26,969 INFO L125 PetriNetUnfolderBase]: For 3094/3110 co-relation queries the response was YES.
[2023-11-26 12:05:26,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10352 conditions, 3379 events. 1878/3379 cut-off events. For 3094/3110 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 26954 event pairs, 473 based on Foata normal form. 48/3128 useless extension candidates. Maximal degree in co-relation 10333. Up to 2543 conditions per place.
[2023-11-26 12:05:26,990 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 49 selfloop transitions, 17 changer transitions 0/85 dead transitions.
[2023-11-26 12:05:26,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 592 flow
[2023-11-26 12:05:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-26 12:05:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-26 12:05:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions.
[2023-11-26 12:05:26,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455
[2023-11-26 12:05:26,992 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 156 transitions.
[2023-11-26 12:05:26,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 156 transitions.
[2023-11-26 12:05:26,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:26,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 156 transitions.
[2023-11-26 12:05:26,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,995 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:26,995 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 388 flow. Second operand 4 states and 156 transitions.
[2023-11-26 12:05:26,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 592 flow
[2023-11-26 12:05:26,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:27,001 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 386 flow
[2023-11-26 12:05:27,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=67, PETRI_TRANSITIONS=68}
[2023-11-26 12:05:27,002 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places.
[2023-11-26 12:05:27,002 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 386 flow
[2023-11-26 12:05:27,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:27,002 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:27,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:27,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-26 12:05:27,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:27,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1095896328, now seen corresponding path program 1 times
[2023-11-26 12:05:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279178200]
[2023-11-26 12:05:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:27,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279178200]
[2023-11-26 12:05:27,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279178200] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:27,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:27,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-26 12:05:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155207790]
[2023-11-26 12:05:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:27,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-26 12:05:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-26 12:05:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2023-11-26 12:05:27,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 110
[2023-11-26 12:05:27,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 386 flow. Second operand has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:27,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:27,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 110
[2023-11-26 12:05:27,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:29,351 INFO L124 PetriNetUnfolderBase]: 5255/9215 cut-off events.
[2023-11-26 12:05:29,351 INFO L125 PetriNetUnfolderBase]: For 8271/8271 co-relation queries the response was YES.
[2023-11-26 12:05:29,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27020 conditions, 9215 events. 5255/9215 cut-off events. For 8271/8271 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 77240 event pairs, 1840 based on Foata normal form. 0/8162 useless extension candidates. Maximal degree in co-relation 27000. Up to 2952 conditions per place.
[2023-11-26 12:05:29,404 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 125 selfloop transitions, 11 changer transitions 8/159 dead transitions.
[2023-11-26 12:05:29,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 159 transitions, 1272 flow
[2023-11-26 12:05:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-26 12:05:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-26 12:05:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions.
[2023-11-26 12:05:29,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34155844155844156
[2023-11-26 12:05:29,407 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 263 transitions.
[2023-11-26 12:05:29,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 263 transitions.
[2023-11-26 12:05:29,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:29,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 263 transitions.
[2023-11-26 12:05:29,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:29,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:29,410 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:29,410 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 386 flow. Second operand 7 states and 263 transitions.
[2023-11-26 12:05:29,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 159 transitions, 1272 flow
[2023-11-26 12:05:29,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 159 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:29,418 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 459 flow
[2023-11-26 12:05:29,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=459, PETRI_PLACES=75, PETRI_TRANSITIONS=78}
[2023-11-26 12:05:29,419 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -13 predicate places.
[2023-11-26 12:05:29,419 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 459 flow
[2023-11-26 12:05:29,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:29,419 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:29,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:29,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-26 12:05:29,419 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:29,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1095897674, now seen corresponding path program 1 times
[2023-11-26 12:05:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118377699]
[2023-11-26 12:05:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:29,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:29,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118377699]
[2023-11-26 12:05:29,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118377699] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:29,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:29,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 12:05:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774543885]
[2023-11-26 12:05:29,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:29,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-26 12:05:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:29,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-26 12:05:29,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-26 12:05:29,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 110
[2023-11-26 12:05:29,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:29,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:29,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 110
[2023-11-26 12:05:29,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:31,539 INFO L124 PetriNetUnfolderBase]: 8160/13065 cut-off events.
[2023-11-26 12:05:31,539 INFO L125 PetriNetUnfolderBase]: For 12763/13195 co-relation queries the response was YES.
[2023-11-26 12:05:31,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39369 conditions, 13065 events. 8160/13065 cut-off events. For 12763/13195 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 97119 event pairs, 1132 based on Foata normal form. 246/12382 useless extension candidates. Maximal degree in co-relation 39346. Up to 9830 conditions per place.
[2023-11-26 12:05:31,609 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 96 selfloop transitions, 5 changer transitions 1/120 dead transitions.
[2023-11-26 12:05:31,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 120 transitions, 926 flow
[2023-11-26 12:05:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-26 12:05:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-26 12:05:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions.
[2023-11-26 12:05:31,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365
[2023-11-26 12:05:31,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 160 transitions.
[2023-11-26 12:05:31,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 160 transitions.
[2023-11-26 12:05:31,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:31,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 160 transitions.
[2023-11-26 12:05:31,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:31,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:31,613 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:31,614 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 459 flow. Second operand 4 states and 160 transitions.
[2023-11-26 12:05:31,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 120 transitions, 926 flow
[2023-11-26 12:05:31,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 926 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-26 12:05:31,658 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 493 flow
[2023-11-26 12:05:31,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=80, PETRI_TRANSITIONS=81}
[2023-11-26 12:05:31,659 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -8 predicate places.
[2023-11-26 12:05:31,659 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 493 flow
[2023-11-26 12:05:31,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:31,659 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:31,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:31,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-26 12:05:31,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:31,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:31,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1629368941, now seen corresponding path program 1 times
[2023-11-26 12:05:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028827422]
[2023-11-26 12:05:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:32,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028827422]
[2023-11-26 12:05:32,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028827422] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:32,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:32,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-11-26 12:05:32,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596980458]
[2023-11-26 12:05:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:32,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-26 12:05:32,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:32,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-26 12:05:32,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2023-11-26 12:05:32,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 110
[2023-11-26 12:05:32,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 493 flow. Second operand has 10 states, 10 states have (on average 23.6) internal successors, (236), 10 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:32,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:32,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 110
[2023-11-26 12:05:32,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:35,275 INFO L124 PetriNetUnfolderBase]: 10277/17331 cut-off events.
[2023-11-26 12:05:35,275 INFO L125 PetriNetUnfolderBase]: For 17534/17600 co-relation queries the response was YES.
[2023-11-26 12:05:35,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53405 conditions, 17331 events. 10277/17331 cut-off events. For 17534/17600 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 141545 event pairs, 4501 based on Foata normal form. 474/16422 useless extension candidates. Maximal degree in co-relation 53377. Up to 9072 conditions per place.
[2023-11-26 12:05:35,421 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 128 selfloop transitions, 13 changer transitions 0/158 dead transitions.
[2023-11-26 12:05:35,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 158 transitions, 1253 flow
[2023-11-26 12:05:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-26 12:05:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-26 12:05:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 268 transitions.
[2023-11-26 12:05:35,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30454545454545456
[2023-11-26 12:05:35,424 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 268 transitions.
[2023-11-26 12:05:35,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 268 transitions.
[2023-11-26 12:05:35,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:35,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 268 transitions.
[2023-11-26 12:05:35,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.5) internal successors, (268), 8 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:35,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:35,429 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:35,429 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 493 flow. Second operand 8 states and 268 transitions.
[2023-11-26 12:05:35,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 158 transitions, 1253 flow
[2023-11-26 12:05:35,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 158 transitions, 1243 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-11-26 12:05:35,693 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 571 flow
[2023-11-26 12:05:35,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=571, PETRI_PLACES=89, PETRI_TRANSITIONS=87}
[2023-11-26 12:05:35,694 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places.
[2023-11-26 12:05:35,695 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 571 flow
[2023-11-26 12:05:35,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.6) internal successors, (236), 10 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:35,695 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:35,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:35,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-26 12:05:35,696 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:35,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1296372521, now seen corresponding path program 2 times
[2023-11-26 12:05:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847674732]
[2023-11-26 12:05:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847674732]
[2023-11-26 12:05:36,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847674732] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:36,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:36,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-11-26 12:05:36,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010702354]
[2023-11-26 12:05:36,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:36,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-26 12:05:36,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:36,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-26 12:05:36,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2023-11-26 12:05:36,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 110
[2023-11-26 12:05:36,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 571 flow. Second operand has 10 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:36,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:36,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 110
[2023-11-26 12:05:36,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:39,434 INFO L124 PetriNetUnfolderBase]: 11013/18792 cut-off events.
[2023-11-26 12:05:39,434 INFO L125 PetriNetUnfolderBase]: For 27027/27055 co-relation queries the response was YES.
[2023-11-26 12:05:39,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59392 conditions, 18792 events. 11013/18792 cut-off events. For 27027/27055 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 157036 event pairs, 4341 based on Foata normal form. 480/17759 useless extension candidates. Maximal degree in co-relation 59360. Up to 6111 conditions per place.
[2023-11-26 12:05:39,598 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 93 selfloop transitions, 18 changer transitions 8/136 dead transitions.
[2023-11-26 12:05:39,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 136 transitions, 1087 flow
[2023-11-26 12:05:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-26 12:05:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-26 12:05:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions.
[2023-11-26 12:05:39,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2806818181818182
[2023-11-26 12:05:39,601 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 247 transitions.
[2023-11-26 12:05:39,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 247 transitions.
[2023-11-26 12:05:39,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:39,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 247 transitions.
[2023-11-26 12:05:39,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 30.875) internal successors, (247), 8 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:39,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:39,605 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 110.0) internal successors, (990), 9 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:39,605 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 571 flow. Second operand 8 states and 247 transitions.
[2023-11-26 12:05:39,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 136 transitions, 1087 flow
[2023-11-26 12:05:40,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 1066 flow, removed 4 selfloop flow, removed 3 redundant places.
[2023-11-26 12:05:40,102 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 592 flow
[2023-11-26 12:05:40,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=87}
[2023-11-26 12:05:40,103 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places.
[2023-11-26 12:05:40,103 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 592 flow
[2023-11-26 12:05:40,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:40,104 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:40,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:40,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-26 12:05:40,104 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:40,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1296373867, now seen corresponding path program 1 times
[2023-11-26 12:05:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:40,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762663894]
[2023-11-26 12:05:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762663894]
[2023-11-26 12:05:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762663894] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:40,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:40,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-26 12:05:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538836450]
[2023-11-26 12:05:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:40,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 12:05:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:40,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 12:05:40,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-26 12:05:40,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 110
[2023-11-26 12:05:40,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 592 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:40,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:40,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 110
[2023-11-26 12:05:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:42,108 INFO L124 PetriNetUnfolderBase]: 7422/11997 cut-off events.
[2023-11-26 12:05:42,108 INFO L125 PetriNetUnfolderBase]: For 13081/13125 co-relation queries the response was YES.
[2023-11-26 12:05:42,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37268 conditions, 11997 events. 7422/11997 cut-off events. For 13081/13125 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 85919 event pairs, 416 based on Foata normal form. 446/11671 useless extension candidates. Maximal degree in co-relation 37238. Up to 6661 conditions per place.
[2023-11-26 12:05:42,192 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 102 selfloop transitions, 8 changer transitions 10/137 dead transitions.
[2023-11-26 12:05:42,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 137 transitions, 1146 flow
[2023-11-26 12:05:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-26 12:05:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-26 12:05:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions.
[2023-11-26 12:05:42,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365
[2023-11-26 12:05:42,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 200 transitions.
[2023-11-26 12:05:42,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 200 transitions.
[2023-11-26 12:05:42,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:42,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 200 transitions.
[2023-11-26 12:05:42,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.0) internal successors, (200), 5 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-26 12:05:42,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 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-26 12:05:42,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 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-26 12:05:42,198 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 592 flow. Second operand 5 states and 200 transitions.
[2023-11-26 12:05:42,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 137 transitions, 1146 flow
[2023-11-26 12:05:42,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 1111 flow, removed 7 selfloop flow, removed 4 redundant places.
[2023-11-26 12:05:42,212 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 474 flow
[2023-11-26 12:05:42,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=94, PETRI_TRANSITIONS=76}
[2023-11-26 12:05:42,213 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 6 predicate places.
[2023-11-26 12:05:42,213 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 474 flow
[2023-11-26 12:05:42,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:42,214 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:42,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:42,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-26 12:05:42,214 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:42,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash 895329899, now seen corresponding path program 1 times
[2023-11-26 12:05:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179906424]
[2023-11-26 12:05:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179906424]
[2023-11-26 12:05:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179906424] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:42,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 12:05:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123979248]
[2023-11-26 12:05:42,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:42,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-26 12:05:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:42,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-26 12:05:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-26 12:05:42,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 110
[2023-11-26 12:05:42,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:42,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:42,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 110
[2023-11-26 12:05:42,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:43,444 INFO L124 PetriNetUnfolderBase]: 3318/5373 cut-off events.
[2023-11-26 12:05:43,444 INFO L125 PetriNetUnfolderBase]: For 8308/8359 co-relation queries the response was YES.
[2023-11-26 12:05:43,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18040 conditions, 5373 events. 3318/5373 cut-off events. For 8308/8359 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 33034 event pairs, 168 based on Foata normal form. 264/5295 useless extension candidates. Maximal degree in co-relation 18023. Up to 1860 conditions per place.
[2023-11-26 12:05:43,485 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 75 selfloop transitions, 11 changer transitions 8/111 dead transitions.
[2023-11-26 12:05:43,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 111 transitions, 863 flow
[2023-11-26 12:05:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-26 12:05:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-26 12:05:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions.
[2023-11-26 12:05:43,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32272727272727275
[2023-11-26 12:05:43,487 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 213 transitions.
[2023-11-26 12:05:43,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 213 transitions.
[2023-11-26 12:05:43,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:43,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 213 transitions.
[2023-11-26 12:05:43,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:43,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:43,490 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:43,490 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 474 flow. Second operand 6 states and 213 transitions.
[2023-11-26 12:05:43,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 111 transitions, 863 flow
[2023-11-26 12:05:43,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 111 transitions, 759 flow, removed 16 selfloop flow, removed 8 redundant places.
[2023-11-26 12:05:43,522 INFO L231 Difference]: Finished difference. Result has 87 places, 59 transitions, 315 flow
[2023-11-26 12:05:43,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=87, PETRI_TRANSITIONS=59}
[2023-11-26 12:05:43,523 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -1 predicate places.
[2023-11-26 12:05:43,523 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 59 transitions, 315 flow
[2023-11-26 12:05:43,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:43,524 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:43,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:43,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-11-26 12:05:43,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:43,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1708324052, now seen corresponding path program 1 times
[2023-11-26 12:05:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441645777]
[2023-11-26 12:05:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:43,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441645777]
[2023-11-26 12:05:43,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441645777] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:43,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 12:05:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524193651]
[2023-11-26 12:05:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:43,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-26 12:05:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:43,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-26 12:05:43,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-26 12:05:43,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110
[2023-11-26 12:05:43,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 59 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-26 12:05:43,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:43,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110
[2023-11-26 12:05:43,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:44,621 INFO L124 PetriNetUnfolderBase]: 2193/4091 cut-off events.
[2023-11-26 12:05:44,621 INFO L125 PetriNetUnfolderBase]: For 3593/3692 co-relation queries the response was YES.
[2023-11-26 12:05:44,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11501 conditions, 4091 events. 2193/4091 cut-off events. For 3593/3692 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 28879 event pairs, 572 based on Foata normal form. 64/3810 useless extension candidates. Maximal degree in co-relation 11485. Up to 1623 conditions per place.
[2023-11-26 12:05:44,654 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 40 selfloop transitions, 3 changer transitions 20/85 dead transitions.
[2023-11-26 12:05:44,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 85 transitions, 527 flow
[2023-11-26 12:05:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-26 12:05:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-26 12:05:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions.
[2023-11-26 12:05:44,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091
[2023-11-26 12:05:44,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 204 transitions.
[2023-11-26 12:05:44,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 204 transitions.
[2023-11-26 12:05:44,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:44,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 204 transitions.
[2023-11-26 12:05:44,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:44,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:44,660 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:44,660 INFO L175 Difference]: Start difference. First operand has 87 places, 59 transitions, 315 flow. Second operand 6 states and 204 transitions.
[2023-11-26 12:05:44,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 85 transitions, 527 flow
[2023-11-26 12:05:44,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 438 flow, removed 19 selfloop flow, removed 13 redundant places.
[2023-11-26 12:05:44,681 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 211 flow
[2023-11-26 12:05:44,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=76, PETRI_TRANSITIONS=52}
[2023-11-26 12:05:44,682 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -12 predicate places.
[2023-11-26 12:05:44,682 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 211 flow
[2023-11-26 12:05:44,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-26 12:05:44,683 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:44,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:44,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-26 12:05:44,683 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:44,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 125207406, now seen corresponding path program 2 times
[2023-11-26 12:05:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:44,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886177059]
[2023-11-26 12:05:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 12:05:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 12:05:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 12:05:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886177059]
[2023-11-26 12:05:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886177059] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 12:05:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 12:05:45,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-26 12:05:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002525366]
[2023-11-26 12:05:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 12:05:45,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-26 12:05:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 12:05:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-26 12:05:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-26 12:05:45,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 110
[2023-11-26 12:05:45,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-26 12:05:45,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 12:05:45,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 110
[2023-11-26 12:05:45,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 12:05:45,378 INFO L124 PetriNetUnfolderBase]: 635/1247 cut-off events.
[2023-11-26 12:05:45,378 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES.
[2023-11-26 12:05:45,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 1247 events. 635/1247 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7014 event pairs, 136 based on Foata normal form. 16/1183 useless extension candidates. Maximal degree in co-relation 2871. Up to 442 conditions per place.
[2023-11-26 12:05:45,382 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 26 selfloop transitions, 1 changer transitions 30/79 dead transitions.
[2023-11-26 12:05:45,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 413 flow
[2023-11-26 12:05:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-26 12:05:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-26 12:05:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions.
[2023-11-26 12:05:45,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31212121212121213
[2023-11-26 12:05:45,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions.
[2023-11-26 12:05:45,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions.
[2023-11-26 12:05:45,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 12:05:45,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions.
[2023-11-26 12:05:45,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:45,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:45,388 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 12:05:45,388 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 211 flow. Second operand 6 states and 206 transitions.
[2023-11-26 12:05:45,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 413 flow
[2023-11-26 12:05:45,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 79 transitions, 379 flow, removed 6 selfloop flow, removed 12 redundant places.
[2023-11-26 12:05:45,392 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 153 flow
[2023-11-26 12:05:45,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=67, PETRI_TRANSITIONS=45}
[2023-11-26 12:05:45,392 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -21 predicate places.
[2023-11-26 12:05:45,393 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 153 flow
[2023-11-26 12:05:45,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-26 12:05:45,393 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-26 12:05:45,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:45,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-11-26 12:05:45,393 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] ===
[2023-11-26 12:05:45,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 12:05:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1213979742, now seen corresponding path program 3 times
[2023-11-26 12:05:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 12:05:45,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048154542]
[2023-11-26 12:05:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 12:05:45,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 12:05:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 12:05:45,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 12:05:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 12:05:45,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 12:05:45,598 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-26 12:05:45,599 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (66 of 67 remaining)
[2023-11-26 12:05:45,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (65 of 67 remaining)
[2023-11-26 12:05:45,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining)
[2023-11-26 12:05:45,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining)
[2023-11-26 12:05:45,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining)
[2023-11-26 12:05:45,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining)
[2023-11-26 12:05:45,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining)
[2023-11-26 12:05:45,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining)
[2023-11-26 12:05:45,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining)
[2023-11-26 12:05:45,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining)
[2023-11-26 12:05:45,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining)
[2023-11-26 12:05:45,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining)
[2023-11-26 12:05:45,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining)
[2023-11-26 12:05:45,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining)
[2023-11-26 12:05:45,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining)
[2023-11-26 12:05:45,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining)
[2023-11-26 12:05:45,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining)
[2023-11-26 12:05:45,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining)
[2023-11-26 12:05:45,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining)
[2023-11-26 12:05:45,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining)
[2023-11-26 12:05:45,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining)
[2023-11-26 12:05:45,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining)
[2023-11-26 12:05:45,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining)
[2023-11-26 12:05:45,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining)
[2023-11-26 12:05:45,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining)
[2023-11-26 12:05:45,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining)
[2023-11-26 12:05:45,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining)
[2023-11-26 12:05:45,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining)
[2023-11-26 12:05:45,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining)
[2023-11-26 12:05:45,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining)
[2023-11-26 12:05:45,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining)
[2023-11-26 12:05:45,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining)
[2023-11-26 12:05:45,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining)
[2023-11-26 12:05:45,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining)
[2023-11-26 12:05:45,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining)
[2023-11-26 12:05:45,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining)
[2023-11-26 12:05:45,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining)
[2023-11-26 12:05:45,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining)
[2023-11-26 12:05:45,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 67 remaining)
[2023-11-26 12:05:45,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 67 remaining)
[2023-11-26 12:05:45,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 67 remaining)
[2023-11-26 12:05:45,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 67 remaining)
[2023-11-26 12:05:45,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 67 remaining)
[2023-11-26 12:05:45,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining)
[2023-11-26 12:05:45,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining)
[2023-11-26 12:05:45,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining)
[2023-11-26 12:05:45,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining)
[2023-11-26 12:05:45,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining)
[2023-11-26 12:05:45,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining)
[2023-11-26 12:05:45,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining)
[2023-11-26 12:05:45,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining)
[2023-11-26 12:05:45,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining)
[2023-11-26 12:05:45,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining)
[2023-11-26 12:05:45,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining)
[2023-11-26 12:05:45,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining)
[2023-11-26 12:05:45,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining)
[2023-11-26 12:05:45,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining)
[2023-11-26 12:05:45,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining)
[2023-11-26 12:05:45,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining)
[2023-11-26 12:05:45,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining)
[2023-11-26 12:05:45,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining)
[2023-11-26 12:05:45,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining)
[2023-11-26 12:05:45,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining)
[2023-11-26 12:05:45,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining)
[2023-11-26 12:05:45,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining)
[2023-11-26 12:05:45,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining)
[2023-11-26 12:05:45,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining)
[2023-11-26 12:05:45,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-26 12:05:45,616 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 12:05:45,623 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-26 12:05:45,623 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-26 12:05:45,708 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated
[2023-11-26 12:05:45,714 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated
[2023-11-26 12:05:45,716 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated
[2023-11-26 12:05:45,739 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0
[2023-11-26 12:05:45,741 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0
[2023-11-26 12:05:45,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:05:45 BasicIcfg
[2023-11-26 12:05:45,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-26 12:05:45,759 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-26 12:05:45,759 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-26 12:05:45,759 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-26 12:05:45,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:01" (3/4) ...
[2023-11-26 12:05:45,762 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-26 12:05:45,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-26 12:05:45,764 INFO L158 Benchmark]: Toolchain (without parser) took 47453.65ms. Allocated memory was 182.5MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 135.6MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB.
[2023-11-26 12:05:45,764 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 132.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-26 12:05:45,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.37ms. Allocated memory is still 182.5MB. Free memory was 134.8MB in the beginning and 110.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2023-11-26 12:05:45,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.16ms. Allocated memory is still 182.5MB. Free memory was 110.4MB in the beginning and 108.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-26 12:05:45,765 INFO L158 Benchmark]: Boogie Preprocessor took 123.53ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 103.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-26 12:05:45,765 INFO L158 Benchmark]: RCFGBuilder took 1825.77ms. Allocated memory is still 182.5MB. Free memory was 103.3MB in the beginning and 133.9MB in the end (delta: -30.6MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB.
[2023-11-26 12:05:45,766 INFO L158 Benchmark]: TraceAbstraction took 44715.29ms. Allocated memory was 182.5MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 132.9MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB.
[2023-11-26 12:05:45,766 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 4.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-26 12:05:45,768 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.29ms. Allocated memory is still 132.1MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 667.37ms. Allocated memory is still 182.5MB. Free memory was 134.8MB in the beginning and 110.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 108.16ms. Allocated memory is still 182.5MB. Free memory was 110.4MB in the beginning and 108.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 123.53ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 103.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1825.77ms. Allocated memory is still 182.5MB. Free memory was 103.3MB in the beginning and 133.9MB in the end (delta: -30.6MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 44715.29ms. Allocated memory was 182.5MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 132.9MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB.
* Witness Printer took 3.96ms. Allocated memory is still 4.0GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 1.0MB). 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~pre25 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable #t~nondet0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable #t~nondet0
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p0_EBX = 0;
[L715] 0 int __unbuffered_p2_EAX = 0;
[L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed;
[L717] 0 int __unbuffered_p2_EAX$mem_tmp;
[L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0;
[L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1;
[L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2;
[L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3;
[L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0;
[L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1;
[L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2;
[L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3;
[L726] 0 _Bool __unbuffered_p2_EAX$read_delayed;
[L727] 0 int *__unbuffered_p2_EAX$read_delayed_var;
[L728] 0 int __unbuffered_p2_EAX$w_buff0;
[L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used;
[L730] 0 int __unbuffered_p2_EAX$w_buff1;
[L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used;
[L732] 0 _Bool main$tmp_guard0;
[L733] 0 _Bool main$tmp_guard1;
[L735] 0 int x = 0;
[L737] 0 int y = 0;
[L737] 0 int y = 0;
[L738] 0 _Bool y$flush_delayed;
[L739] 0 int y$mem_tmp;
[L740] 0 _Bool y$r_buff0_thd0;
[L741] 0 _Bool y$r_buff0_thd1;
[L742] 0 _Bool y$r_buff0_thd2;
[L743] 0 _Bool y$r_buff0_thd3;
[L744] 0 _Bool y$r_buff1_thd0;
[L745] 0 _Bool y$r_buff1_thd1;
[L746] 0 _Bool y$r_buff1_thd2;
[L747] 0 _Bool y$r_buff1_thd3;
[L748] 0 _Bool y$read_delayed;
[L749] 0 int *y$read_delayed_var;
[L750] 0 int y$w_buff0;
[L751] 0 _Bool y$w_buff0_used;
[L752] 0 int y$w_buff1;
[L753] 0 _Bool y$w_buff1_used;
[L755] 0 int z = 0;
[L756] 0 _Bool weak$$choice0;
[L757] 0 _Bool weak$$choice1;
[L758] 0 _Bool weak$$choice2;
[L850] 0 pthread_t t2052;
[L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0]
[L852] 0 pthread_t t2053;
[L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={6:0}, t2053={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0]
[L854] 0 pthread_t t2054;
[L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={6:0}, t2053={7:0}, t2054={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0]
[L806] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L807] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L808] 3 y$flush_delayed = weak$$choice2
[L809] EXPR 3 \read(y)
[L809] 3 y$mem_tmp = y
[L810] 3 weak$$choice1 = __VERIFIER_nondet_bool()
[L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L811] EXPR 3 \read(y)
[L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))))
[L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))))
[L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))
[L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))
[L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y
[L820] EXPR 3 \read(y)
[L820] 3 __unbuffered_p2_EAX = y
[L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y
[L821] EXPR 3 \read(y)
[L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y
[L821] 3 y = y$flush_delayed ? y$mem_tmp : y
[L822] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0]
[L825] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L762] 1 __unbuffered_p0_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L765] 1 __unbuffered_p0_EBX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L828] EXPR 3 \read(y)
[L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L777] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L780] 2 y$w_buff1 = y$w_buff0
[L781] 2 y$w_buff0 = 1
[L782] 2 y$w_buff1_used = y$w_buff0_used
[L783] 2 y$w_buff0_used = (_Bool)1
[L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3
[L789] 2 y$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={6:0}, t2053={7:0}, t2054={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L859] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L859] RET 0 assume_abort_if_not(main$tmp_guard0)
[L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L861] EXPR 0 \read(y)
[L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={6:0}, t2053={7:0}, t2054={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L868] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var)
[L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={6:0}, t2053={7:0}, t2054={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L872] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
[L17] 0 __assert_fail ("0", "safe012_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -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: -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: 848]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 853]: 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: 855]: 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: 851]: 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, 131 locations, 67 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: 44.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1428 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1234 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3885 IncrementalHoareTripleChecker+Invalid, 4026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 51 mSDtfsCounter, 3885 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=17, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 2231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-11-26 12:05:45,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6be8cc41-acc1-4728-8023-6afa0d0c597b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...