./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC --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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 01:49:59,508 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 01:49:59,576 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-24 01:49:59,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 01:49:59,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 01:49:59,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 01:49:59,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 01:49:59,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 01:49:59,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 01:49:59,628 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 01:49:59,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 01:49:59,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 01:49:59,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 01:49:59,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 01:49:59,629 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 01:49:59,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 01:49:59,631 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 01:49:59,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 01:49:59,631 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 01:49:59,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 01:49:59,631 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 01:49:59,631 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 01:49:59,632 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 01:49:59,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 01:49:59,632 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 01:49:59,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 01:49:59,632 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 01:49:59,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 01:49:59,632 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 01:49:59,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:49:59,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:49:59,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 01:49:59,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 01:49:59,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 01:49:59,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 01:49:59,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 01:49:59,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 01:49:59,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 01:49:59,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 01:49:59,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC
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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6
[2024-11-24 01:49:59,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 01:49:59,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 01:49:59,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 01:49:59,978 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 01:49:59,979 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 01:49:59,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 01:50:03,002 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/c665c1c41/2599ef2df3e64442ad3f68dc267c4ff6/FLAG30df0441f
[2024-11-24 01:50:03,358 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 01:50:03,358 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 01:50:03,381 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/c665c1c41/2599ef2df3e64442ad3f68dc267c4ff6/FLAG30df0441f
[2024-11-24 01:50:03,562 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/c665c1c41/2599ef2df3e64442ad3f68dc267c4ff6
[2024-11-24 01:50:03,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 01:50:03,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 01:50:03,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 01:50:03,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 01:50:03,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 01:50:03,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:50:03" (1/1) ...
[2024-11-24 01:50:03,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d24fc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:03, skipping insertion in model container
[2024-11-24 01:50:03,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:50:03" (1/1) ...
[2024-11-24 01:50:03,632 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 01:50:04,007 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:50:04,018 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 01:50:04,096 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:50:04,148 INFO L204 MainTranslator]: Completed translation
[2024-11-24 01:50:04,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04 WrapperNode
[2024-11-24 01:50:04,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 01:50:04,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 01:50:04,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 01:50:04,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 01:50:04,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,235 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136
[2024-11-24 01:50:04,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 01:50:04,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 01:50:04,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 01:50:04,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 01:50:04,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,284 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-24 01:50:04,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 01:50:04,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 01:50:04,318 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 01:50:04,318 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 01:50:04,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (1/1) ...
[2024-11-24 01:50:04,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:50:04,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:04,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 01:50:04,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 01:50:04,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 01:50:04,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 01:50:04,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 01:50:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 01:50:04,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 01:50:04,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 01:50:04,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 01:50:04,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 01:50:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 01:50:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 01:50:04,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 01:50:04,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 01:50:04,395 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 01:50:04,564 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 01:50:04,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 01:50:04,954 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 01:50:04,954 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 01:50:05,248 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 01:50:05,249 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 01:50:05,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:50:05 BoogieIcfgContainer
[2024-11-24 01:50:05,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 01:50:05,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 01:50:05,254 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 01:50:05,260 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 01:50:05,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:50:03" (1/3) ...
[2024-11-24 01:50:05,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a06dd35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:50:05, skipping insertion in model container
[2024-11-24 01:50:05,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:04" (2/3) ...
[2024-11-24 01:50:05,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a06dd35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:50:05, skipping insertion in model container
[2024-11-24 01:50:05,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:50:05" (3/3) ...
[2024-11-24 01:50:05,264 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 01:50:05,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 01:50:05,287 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-11-24 01:50:05,287 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 01:50:05,361 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 01:50:05,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow
[2024-11-24 01:50:05,448 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-11-24 01:50:05,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:50:05,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place.
[2024-11-24 01:50:05,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow
[2024-11-24 01:50:05,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow
[2024-11-24 01:50:05,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:50:05,497 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@320e2e1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:50:05,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-24 01:50:05,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:50:05,506 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-24 01:50:05,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:50:05,506 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:05,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-24 01:50:05,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:05,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash 11874970, now seen corresponding path program 1 times
[2024-11-24 01:50:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:05,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920395568]
[2024-11-24 01:50:05,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920395568]
[2024-11-24 01:50:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920395568] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:06,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:50:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595117663]
[2024-11-24 01:50:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:06,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:50:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:06,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:50:06,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:50:06,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44
[2024-11-24 01:50:06,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:06,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:06,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44
[2024-11-24 01:50:06,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:06,744 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events.
[2024-11-24 01:50:06,744 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES.
[2024-11-24 01:50:06,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place.
[2024-11-24 01:50:06,765 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions.
[2024-11-24 01:50:06,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow
[2024-11-24 01:50:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:50:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:50:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions.
[2024-11-24 01:50:06,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75
[2024-11-24 01:50:06,787 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions.
[2024-11-24 01:50:06,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow
[2024-11-24 01:50:06,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 01:50:06,799 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow
[2024-11-24 01:50:06,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-11-24 01:50:06,808 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places.
[2024-11-24 01:50:06,810 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow
[2024-11-24 01:50:06,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:06,810 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:06,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:06,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 01:50:06,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:06,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash 625606107, now seen corresponding path program 1 times
[2024-11-24 01:50:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:06,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954598553]
[2024-11-24 01:50:06,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:06,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:06,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954598553]
[2024-11-24 01:50:06,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954598553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:06,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:06,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:50:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900688953]
[2024-11-24 01:50:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:50:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:06,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:50:06,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:50:07,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44
[2024-11-24 01:50:07,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:07,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:07,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44
[2024-11-24 01:50:07,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:07,377 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events.
[2024-11-24 01:50:07,377 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES.
[2024-11-24 01:50:07,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7018 event pairs, 605 based on Foata normal form. 36/1123 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place.
[2024-11-24 01:50:07,391 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions.
[2024-11-24 01:50:07,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow
[2024-11-24 01:50:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:50:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:50:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions.
[2024-11-24 01:50:07,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182
[2024-11-24 01:50:07,393 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions.
[2024-11-24 01:50:07,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow
[2024-11-24 01:50:07,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:50:07,395 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow
[2024-11-24 01:50:07,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34}
[2024-11-24 01:50:07,396 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places.
[2024-11-24 01:50:07,396 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow
[2024-11-24 01:50:07,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:07,398 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:07,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:07,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 01:50:07,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash 625607718, now seen corresponding path program 1 times
[2024-11-24 01:50:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:07,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573687554]
[2024-11-24 01:50:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573687554]
[2024-11-24 01:50:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573687554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:08,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:50:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563181603]
[2024-11-24 01:50:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:08,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:08,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:08,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:08,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-11-24 01:50:08,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:08,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:08,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-11-24 01:50:08,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:10,666 INFO L124 PetriNetUnfolderBase]: 3181/5158 cut-off events.
[2024-11-24 01:50:10,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:50:10,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9892 conditions, 5158 events. 3181/5158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 33096 event pairs, 392 based on Foata normal form. 0/5021 useless extension candidates. Maximal degree in co-relation 9886. Up to 2283 conditions per place.
[2024-11-24 01:50:10,694 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 41 selfloop transitions, 12 changer transitions 90/153 dead transitions.
[2024-11-24 01:50:10,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 153 transitions, 604 flow
[2024-11-24 01:50:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-24 01:50:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-11-24 01:50:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 314 transitions.
[2024-11-24 01:50:10,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697
[2024-11-24 01:50:10,698 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 314 transitions.
[2024-11-24 01:50:10,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 153 transitions, 604 flow
[2024-11-24 01:50:10,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 153 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 01:50:10,703 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 213 flow
[2024-11-24 01:50:10,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=44}
[2024-11-24 01:50:10,703 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places.
[2024-11-24 01:50:10,704 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 213 flow
[2024-11-24 01:50:10,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:10,704 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:10,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:10,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 01:50:10,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:10,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 827570693, now seen corresponding path program 1 times
[2024-11-24 01:50:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712206690]
[2024-11-24 01:50:10,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712206690]
[2024-11-24 01:50:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712206690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:50:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140984732]
[2024-11-24 01:50:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:11,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:11,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:11,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:11,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:11,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-11-24 01:50:11,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:11,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:11,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-11-24 01:50:11,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:12,997 INFO L124 PetriNetUnfolderBase]: 2355/3922 cut-off events.
[2024-11-24 01:50:12,997 INFO L125 PetriNetUnfolderBase]: For 8780/8783 co-relation queries the response was YES.
[2024-11-24 01:50:13,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14278 conditions, 3922 events. 2355/3922 cut-off events. For 8780/8783 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 24816 event pairs, 500 based on Foata normal form. 99/4015 useless extension candidates. Maximal degree in co-relation 14260. Up to 2269 conditions per place.
[2024-11-24 01:50:13,032 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 46 selfloop transitions, 19 changer transitions 54/129 dead transitions.
[2024-11-24 01:50:13,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 129 transitions, 951 flow
[2024-11-24 01:50:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-24 01:50:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-24 01:50:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions.
[2024-11-24 01:50:13,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575
[2024-11-24 01:50:13,037 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 213 flow. Second operand 10 states and 253 transitions.
[2024-11-24 01:50:13,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 129 transitions, 951 flow
[2024-11-24 01:50:13,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 129 transitions, 875 flow, removed 38 selfloop flow, removed 4 redundant places.
[2024-11-24 01:50:13,077 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 361 flow
[2024-11-24 01:50:13,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=69, PETRI_TRANSITIONS=53}
[2024-11-24 01:50:13,079 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places.
[2024-11-24 01:50:13,079 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 361 flow
[2024-11-24 01:50:13,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:13,080 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:13,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:13,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 01:50:13,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:13,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash 59559027, now seen corresponding path program 1 times
[2024-11-24 01:50:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827061629]
[2024-11-24 01:50:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:13,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827061629]
[2024-11-24 01:50:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827061629] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:50:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463641760]
[2024-11-24 01:50:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:13,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:50:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:13,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:50:13,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:50:13,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-24 01:50:13,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:13,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:13,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-24 01:50:13,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:14,486 INFO L124 PetriNetUnfolderBase]: 2791/4724 cut-off events.
[2024-11-24 01:50:14,486 INFO L125 PetriNetUnfolderBase]: For 16588/17316 co-relation queries the response was YES.
[2024-11-24 01:50:14,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18998 conditions, 4724 events. 2791/4724 cut-off events. For 16588/17316 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32211 event pairs, 663 based on Foata normal form. 392/4954 useless extension candidates. Maximal degree in co-relation 18973. Up to 2030 conditions per place.
[2024-11-24 01:50:14,594 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 46 selfloop transitions, 6 changer transitions 47/118 dead transitions.
[2024-11-24 01:50:14,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1019 flow
[2024-11-24 01:50:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:50:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:50:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions.
[2024-11-24 01:50:14,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5941558441558441
[2024-11-24 01:50:14,595 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 361 flow. Second operand 7 states and 183 transitions.
[2024-11-24 01:50:14,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1019 flow
[2024-11-24 01:50:14,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 977 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-11-24 01:50:14,632 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 371 flow
[2024-11-24 01:50:14,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=68, PETRI_TRANSITIONS=53}
[2024-11-24 01:50:14,636 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places.
[2024-11-24 01:50:14,636 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 371 flow
[2024-11-24 01:50:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:14,637 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:14,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:14,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 01:50:14,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:14,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1393230876, now seen corresponding path program 1 times
[2024-11-24 01:50:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:14,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266281699]
[2024-11-24 01:50:14,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:15,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266281699]
[2024-11-24 01:50:15,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266281699] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:15,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:15,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:50:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255417686]
[2024-11-24 01:50:15,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:15,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:15,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:15,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:15,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:15,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-24 01:50:15,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:15,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:15,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-24 01:50:15,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:16,625 INFO L124 PetriNetUnfolderBase]: 3231/5480 cut-off events.
[2024-11-24 01:50:16,626 INFO L125 PetriNetUnfolderBase]: For 17539/18594 co-relation queries the response was YES.
[2024-11-24 01:50:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21658 conditions, 5480 events. 3231/5480 cut-off events. For 17539/18594 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38051 event pairs, 976 based on Foata normal form. 607/5881 useless extension candidates. Maximal degree in co-relation 21633. Up to 3591 conditions per place.
[2024-11-24 01:50:16,670 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 37 selfloop transitions, 4 changer transitions 39/106 dead transitions.
[2024-11-24 01:50:16,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 877 flow
[2024-11-24 01:50:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:50:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:50:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions.
[2024-11-24 01:50:16,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811688311688312
[2024-11-24 01:50:16,674 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 371 flow. Second operand 7 states and 179 transitions.
[2024-11-24 01:50:16,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 877 flow
[2024-11-24 01:50:16,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 855 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-11-24 01:50:16,748 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 417 flow
[2024-11-24 01:50:16,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=70, PETRI_TRANSITIONS=56}
[2024-11-24 01:50:16,751 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places.
[2024-11-24 01:50:16,751 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 417 flow
[2024-11-24 01:50:16,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:16,751 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:16,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:16,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 01:50:16,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:16,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:16,753 INFO L85 PathProgramCache]: Analyzing trace with hash 810999619, now seen corresponding path program 1 times
[2024-11-24 01:50:16,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:16,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760404743]
[2024-11-24 01:50:16,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760404743]
[2024-11-24 01:50:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760404743] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:50:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076056075]
[2024-11-24 01:50:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:17,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:17,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:17,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-11-24 01:50:17,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:17,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:17,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-11-24 01:50:17,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:19,082 INFO L124 PetriNetUnfolderBase]: 4492/7749 cut-off events.
[2024-11-24 01:50:19,082 INFO L125 PetriNetUnfolderBase]: For 25276/25308 co-relation queries the response was YES.
[2024-11-24 01:50:19,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31852 conditions, 7749 events. 4492/7749 cut-off events. For 25276/25308 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 58000 event pairs, 985 based on Foata normal form. 196/7884 useless extension candidates. Maximal degree in co-relation 31825. Up to 2933 conditions per place.
[2024-11-24 01:50:19,134 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 57 selfloop transitions, 21 changer transitions 55/144 dead transitions.
[2024-11-24 01:50:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 1290 flow
[2024-11-24 01:50:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-24 01:50:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-24 01:50:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions.
[2024-11-24 01:50:19,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091
[2024-11-24 01:50:19,137 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 417 flow. Second operand 10 states and 246 transitions.
[2024-11-24 01:50:19,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 1290 flow
[2024-11-24 01:50:19,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 1267 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-11-24 01:50:19,186 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 607 flow
[2024-11-24 01:50:19,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=607, PETRI_PLACES=81, PETRI_TRANSITIONS=63}
[2024-11-24 01:50:19,187 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places.
[2024-11-24 01:50:19,187 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 607 flow
[2024-11-24 01:50:19,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:19,187 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:19,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:19,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 01:50:19,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1542743980, now seen corresponding path program 1 times
[2024-11-24 01:50:19,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:19,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268115581]
[2024-11-24 01:50:19,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:19,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268115581]
[2024-11-24 01:50:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268115581] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:19,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:19,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:50:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226059031]
[2024-11-24 01:50:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:19,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:19,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:19,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:19,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:19,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-24 01:50:19,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:19,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:19,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-24 01:50:19,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:20,715 INFO L124 PetriNetUnfolderBase]: 4122/7298 cut-off events.
[2024-11-24 01:50:20,715 INFO L125 PetriNetUnfolderBase]: For 42892/44051 co-relation queries the response was YES.
[2024-11-24 01:50:20,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33715 conditions, 7298 events. 4122/7298 cut-off events. For 42892/44051 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 55803 event pairs, 1856 based on Foata normal form. 634/7776 useless extension candidates. Maximal degree in co-relation 33680. Up to 4832 conditions per place.
[2024-11-24 01:50:20,760 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 14 changer transitions 42/132 dead transitions.
[2024-11-24 01:50:20,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 1473 flow
[2024-11-24 01:50:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 01:50:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 01:50:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions.
[2024-11-24 01:50:20,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636
[2024-11-24 01:50:20,763 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 607 flow. Second operand 8 states and 205 transitions.
[2024-11-24 01:50:20,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 1473 flow
[2024-11-24 01:50:20,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 1415 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-11-24 01:50:20,844 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 721 flow
[2024-11-24 01:50:20,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=84, PETRI_TRANSITIONS=70}
[2024-11-24 01:50:20,846 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places.
[2024-11-24 01:50:20,846 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 721 flow
[2024-11-24 01:50:20,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:20,847 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:20,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:20,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 01:50:20,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:20,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:20,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1127372396, now seen corresponding path program 2 times
[2024-11-24 01:50:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:20,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732548001]
[2024-11-24 01:50:20,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 01:50:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:20,889 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:50:20,889 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:50:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732548001]
[2024-11-24 01:50:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732548001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:21,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:21,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:50:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460717933]
[2024-11-24 01:50:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 01:50:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:21,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 01:50:21,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-24 01:50:21,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-24 01:50:21,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 721 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:21,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:21,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-24 01:50:21,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:22,812 INFO L124 PetriNetUnfolderBase]: 3958/7012 cut-off events.
[2024-11-24 01:50:22,812 INFO L125 PetriNetUnfolderBase]: For 46743/47730 co-relation queries the response was YES.
[2024-11-24 01:50:22,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34259 conditions, 7012 events. 3958/7012 cut-off events. For 46743/47730 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 53324 event pairs, 1805 based on Foata normal form. 624/7481 useless extension candidates. Maximal degree in co-relation 34220. Up to 4749 conditions per place.
[2024-11-24 01:50:22,856 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 45 selfloop transitions, 14 changer transitions 42/128 dead transitions.
[2024-11-24 01:50:22,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 128 transitions, 1476 flow
[2024-11-24 01:50:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-24 01:50:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-24 01:50:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions.
[2024-11-24 01:50:22,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364
[2024-11-24 01:50:22,858 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 721 flow. Second operand 8 states and 202 transitions.
[2024-11-24 01:50:22,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 128 transitions, 1476 flow
[2024-11-24 01:50:22,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1424 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-11-24 01:50:22,950 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 739 flow
[2024-11-24 01:50:22,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=739, PETRI_PLACES=87, PETRI_TRANSITIONS=70}
[2024-11-24 01:50:22,951 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places.
[2024-11-24 01:50:22,951 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 739 flow
[2024-11-24 01:50:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:22,952 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:22,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:22,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 01:50:22,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:22,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -97355430, now seen corresponding path program 1 times
[2024-11-24 01:50:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:22,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621015066]
[2024-11-24 01:50:22,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:24,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621015066]
[2024-11-24 01:50:24,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621015066] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:24,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:24,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:50:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673451358]
[2024-11-24 01:50:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:24,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 01:50:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:24,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 01:50:24,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-24 01:50:24,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-11-24 01:50:24,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:24,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:24,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-11-24 01:50:24,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:25,732 INFO L124 PetriNetUnfolderBase]: 4961/8462 cut-off events.
[2024-11-24 01:50:25,732 INFO L125 PetriNetUnfolderBase]: For 57395/57418 co-relation queries the response was YES.
[2024-11-24 01:50:25,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41506 conditions, 8462 events. 4961/8462 cut-off events. For 57395/57418 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 62179 event pairs, 1438 based on Foata normal form. 244/8701 useless extension candidates. Maximal degree in co-relation 41465. Up to 4922 conditions per place.
[2024-11-24 01:50:25,773 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 68 selfloop transitions, 34 changer transitions 94/205 dead transitions.
[2024-11-24 01:50:25,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 205 transitions, 2562 flow
[2024-11-24 01:50:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-24 01:50:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-24 01:50:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions.
[2024-11-24 01:50:25,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55
[2024-11-24 01:50:25,776 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 739 flow. Second operand 10 states and 242 transitions.
[2024-11-24 01:50:25,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 205 transitions, 2562 flow
[2024-11-24 01:50:25,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 205 transitions, 2492 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-11-24 01:50:25,869 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 1090 flow
[2024-11-24 01:50:25,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1090, PETRI_PLACES=94, PETRI_TRANSITIONS=88}
[2024-11-24 01:50:25,870 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places.
[2024-11-24 01:50:25,870 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 1090 flow
[2024-11-24 01:50:25,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:25,870 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:25,871 INFO L206 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]
[2024-11-24 01:50:25,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 01:50:25,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:25,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash -364931210, now seen corresponding path program 1 times
[2024-11-24 01:50:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:25,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957773779]
[2024-11-24 01:50:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:26,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957773779]
[2024-11-24 01:50:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957773779] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:26,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:50:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044656603]
[2024-11-24 01:50:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:26,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 01:50:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:26,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 01:50:26,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 01:50:26,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-24 01:50:26,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 1090 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:26,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:26,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-24 01:50:26,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:26,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, 49#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)])
[2024-11-24 01:50:26,557 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2024-11-24 01:50:26,557 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2024-11-24 01:50:26,557 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2024-11-24 01:50:26,557 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2024-11-24 01:50:26,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), 14#L762true, Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)])
[2024-11-24 01:50:26,739 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2024-11-24 01:50:26,739 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2024-11-24 01:50:26,739 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2024-11-24 01:50:26,739 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2024-11-24 01:50:26,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), 51#true, Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)])
[2024-11-24 01:50:26,929 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event
[2024-11-24 01:50:26,929 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2024-11-24 01:50:26,929 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2024-11-24 01:50:26,929 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2024-11-24 01:50:27,958 INFO L124 PetriNetUnfolderBase]: 6633/10569 cut-off events.
[2024-11-24 01:50:27,958 INFO L125 PetriNetUnfolderBase]: For 97646/100947 co-relation queries the response was YES.
[2024-11-24 01:50:27,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 10569 events. 6633/10569 cut-off events. For 97646/100947 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 71253 event pairs, 1018 based on Foata normal form. 1950/12128 useless extension candidates. Maximal degree in co-relation 51629. Up to 5701 conditions per place.
[2024-11-24 01:50:28,014 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 5 changer transitions 6/123 dead transitions.
[2024-11-24 01:50:28,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 123 transitions, 1635 flow
[2024-11-24 01:50:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 01:50:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 01:50:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions.
[2024-11-24 01:50:28,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636
[2024-11-24 01:50:28,015 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 1090 flow. Second operand 4 states and 108 transitions.
[2024-11-24 01:50:28,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 123 transitions, 1635 flow
[2024-11-24 01:50:28,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 123 transitions, 1595 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-11-24 01:50:28,083 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 1019 flow
[2024-11-24 01:50:28,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1019, PETRI_PLACES=87, PETRI_TRANSITIONS=86}
[2024-11-24 01:50:28,084 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places.
[2024-11-24 01:50:28,084 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 1019 flow
[2024-11-24 01:50:28,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:28,084 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:28,084 INFO L206 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]
[2024-11-24 01:50:28,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 01:50:28,084 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:28,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2047113351, now seen corresponding path program 1 times
[2024-11-24 01:50:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736125487]
[2024-11-24 01:50:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736125487]
[2024-11-24 01:50:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736125487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:28,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:28,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 01:50:28,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615353132]
[2024-11-24 01:50:28,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:28,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:50:28,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:28,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:50:28,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:50:28,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-24 01:50:28,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 1019 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:28,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:28,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-24 01:50:28,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:28,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 250#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)])
[2024-11-24 01:50:28,603 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2024-11-24 01:50:28,603 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2024-11-24 01:50:28,603 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2024-11-24 01:50:28,603 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2024-11-24 01:50:28,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 14#L762true, Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)])
[2024-11-24 01:50:28,657 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2024-11-24 01:50:28,657 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2024-11-24 01:50:28,657 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2024-11-24 01:50:28,657 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2024-11-24 01:50:28,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)])
[2024-11-24 01:50:28,740 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event
[2024-11-24 01:50:28,740 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2024-11-24 01:50:28,740 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2024-11-24 01:50:28,740 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event
[2024-11-24 01:50:29,363 INFO L124 PetriNetUnfolderBase]: 4618/7370 cut-off events.
[2024-11-24 01:50:29,363 INFO L125 PetriNetUnfolderBase]: For 54185/56190 co-relation queries the response was YES.
[2024-11-24 01:50:29,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34907 conditions, 7370 events. 4618/7370 cut-off events. For 54185/56190 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 47430 event pairs, 435 based on Foata normal form. 1272/8301 useless extension candidates. Maximal degree in co-relation 34863. Up to 2597 conditions per place.
[2024-11-24 01:50:29,391 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 8 changer transitions 16/133 dead transitions.
[2024-11-24 01:50:29,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 133 transitions, 1678 flow
[2024-11-24 01:50:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:50:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:50:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions.
[2024-11-24 01:50:29,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727
[2024-11-24 01:50:29,393 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 1019 flow. Second operand 5 states and 137 transitions.
[2024-11-24 01:50:29,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 133 transitions, 1678 flow
[2024-11-24 01:50:29,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 133 transitions, 1650 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-11-24 01:50:29,419 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 904 flow
[2024-11-24 01:50:29,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=904, PETRI_PLACES=90, PETRI_TRANSITIONS=81}
[2024-11-24 01:50:29,420 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places.
[2024-11-24 01:50:29,420 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 904 flow
[2024-11-24 01:50:29,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:29,421 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:29,421 INFO L206 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]
[2024-11-24 01:50:29,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-24 01:50:29,421 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:29,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:29,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1030053428, now seen corresponding path program 1 times
[2024-11-24 01:50:29,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:29,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282522751]
[2024-11-24 01:50:29,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:29,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:30,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282522751]
[2024-11-24 01:50:30,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282522751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:30,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-24 01:50:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498696166]
[2024-11-24 01:50:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:30,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-24 01:50:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:30,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-24 01:50:30,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-24 01:50:30,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-24 01:50:30,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:30,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:30,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-24 01:50:30,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:31,736 INFO L124 PetriNetUnfolderBase]: 3248/6253 cut-off events.
[2024-11-24 01:50:31,737 INFO L125 PetriNetUnfolderBase]: For 31534/33181 co-relation queries the response was YES.
[2024-11-24 01:50:31,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27203 conditions, 6253 events. 3248/6253 cut-off events. For 31534/33181 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 50029 event pairs, 1073 based on Foata normal form. 489/6189 useless extension candidates. Maximal degree in co-relation 27172. Up to 2858 conditions per place.
[2024-11-24 01:50:31,771 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 44 selfloop transitions, 19 changer transitions 38/139 dead transitions.
[2024-11-24 01:50:31,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 139 transitions, 1585 flow
[2024-11-24 01:50:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 01:50:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 01:50:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions.
[2024-11-24 01:50:31,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656
[2024-11-24 01:50:31,773 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 904 flow. Second operand 9 states and 224 transitions.
[2024-11-24 01:50:31,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 139 transitions, 1585 flow
[2024-11-24 01:50:31,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1546 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-11-24 01:50:31,802 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 977 flow
[2024-11-24 01:50:31,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=977, PETRI_PLACES=100, PETRI_TRANSITIONS=82}
[2024-11-24 01:50:31,803 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places.
[2024-11-24 01:50:31,803 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 977 flow
[2024-11-24 01:50:31,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:31,803 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:31,803 INFO L206 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]
[2024-11-24 01:50:31,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-24 01:50:31,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1349137058, now seen corresponding path program 1 times
[2024-11-24 01:50:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77146214]
[2024-11-24 01:50:31,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:32,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77146214]
[2024-11-24 01:50:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77146214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:32,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:50:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611194590]
[2024-11-24 01:50:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:32,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:32,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:32,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:32,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-24 01:50:32,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:32,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:32,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-24 01:50:32,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:32,971 INFO L124 PetriNetUnfolderBase]: 3900/6494 cut-off events.
[2024-11-24 01:50:32,971 INFO L125 PetriNetUnfolderBase]: For 57450/58703 co-relation queries the response was YES.
[2024-11-24 01:50:32,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30586 conditions, 6494 events. 3900/6494 cut-off events. For 57450/58703 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 43629 event pairs, 396 based on Foata normal form. 881/7154 useless extension candidates. Maximal degree in co-relation 30550. Up to 2464 conditions per place.
[2024-11-24 01:50:32,997 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 58 selfloop transitions, 11 changer transitions 30/120 dead transitions.
[2024-11-24 01:50:32,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 1554 flow
[2024-11-24 01:50:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:50:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:50:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions.
[2024-11-24 01:50:32,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182
[2024-11-24 01:50:32,999 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 977 flow. Second operand 6 states and 150 transitions.
[2024-11-24 01:50:32,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 1554 flow
[2024-11-24 01:50:33,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 1364 flow, removed 85 selfloop flow, removed 11 redundant places.
[2024-11-24 01:50:33,043 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 622 flow
[2024-11-24 01:50:33,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=92, PETRI_TRANSITIONS=64}
[2024-11-24 01:50:33,044 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places.
[2024-11-24 01:50:33,044 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 622 flow
[2024-11-24 01:50:33,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:33,044 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:33,044 INFO L206 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]
[2024-11-24 01:50:33,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-24 01:50:33,044 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:33,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1860468819, now seen corresponding path program 1 times
[2024-11-24 01:50:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499108338]
[2024-11-24 01:50:33,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:50:34,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499108338]
[2024-11-24 01:50:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499108338] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-24 01:50:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654678701]
[2024-11-24 01:50:34,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:34,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-24 01:50:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:50:34,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-24 01:50:34,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-24 01:50:34,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-24 01:50:34,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 622 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:34,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:34,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-24 01:50:34,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:35,522 INFO L124 PetriNetUnfolderBase]: 843/1745 cut-off events.
[2024-11-24 01:50:35,522 INFO L125 PetriNetUnfolderBase]: For 8026/8377 co-relation queries the response was YES.
[2024-11-24 01:50:35,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 1745 events. 843/1745 cut-off events. For 8026/8377 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11548 event pairs, 234 based on Foata normal form. 78/1647 useless extension candidates. Maximal degree in co-relation 6842. Up to 621 conditions per place.
[2024-11-24 01:50:35,534 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 32 selfloop transitions, 6 changer transitions 23/89 dead transitions.
[2024-11-24 01:50:35,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 831 flow
[2024-11-24 01:50:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:50:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:50:35,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-11-24 01:50:35,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.538961038961039
[2024-11-24 01:50:35,536 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 622 flow. Second operand 7 states and 166 transitions.
[2024-11-24 01:50:35,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 831 flow
[2024-11-24 01:50:35,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 670 flow, removed 46 selfloop flow, removed 16 redundant places.
[2024-11-24 01:50:35,561 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 401 flow
[2024-11-24 01:50:35,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=85, PETRI_TRANSITIONS=57}
[2024-11-24 01:50:35,562 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places.
[2024-11-24 01:50:35,562 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 401 flow
[2024-11-24 01:50:35,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:35,562 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:35,562 INFO L206 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]
[2024-11-24 01:50:35,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-24 01:50:35,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:35,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:35,563 INFO L85 PathProgramCache]: Analyzing trace with hash -462981715, now seen corresponding path program 2 times
[2024-11-24 01:50:35,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:50:35,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40601275]
[2024-11-24 01:50:35,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 01:50:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:50:35,643 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:50:35,643 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 01:50:35,643 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:50:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:50:35,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 01:50:35,761 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:50:35,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-24 01:50:35,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-24 01:50:35,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-24 01:50:35,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-24 01:50:35,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-24 01:50:35,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-24 01:50:35,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-24 01:50:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-24 01:50:35,766 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:35,872 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 01:50:35,872 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 01:50:35,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:50:35 BasicIcfg
[2024-11-24 01:50:35,882 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 01:50:35,883 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 01:50:35,883 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 01:50:35,883 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 01:50:35,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:50:05" (3/4) ...
[2024-11-24 01:50:35,887 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-24 01:50:35,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 01:50:35,890 INFO L158 Benchmark]: Toolchain (without parser) took 32323.09ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 91.5MB in the beginning and 1.1GB in the end (delta: -998.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB.
[2024-11-24 01:50:35,891 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:50:35,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.34ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 68.2MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-24 01:50:35,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.24ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 65.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:50:35,892 INFO L158 Benchmark]: Boogie Preprocessor took 79.79ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.5MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:50:35,893 INFO L158 Benchmark]: RCFGBuilder took 931.96ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 66.7MB in the end (delta: -4.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
[2024-11-24 01:50:35,893 INFO L158 Benchmark]: TraceAbstraction took 30629.70ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 66.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB.
[2024-11-24 01:50:35,894 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 166.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:50:35,897 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.44ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 584.34ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 68.2MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 81.24ms. Allocated memory is still 117.4MB. Free memory was 68.2MB in the beginning and 65.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 79.79ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.5MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 931.96ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 66.7MB in the end (delta: -4.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 30629.70ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 66.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB.
* Witness Printer took 4.99ms. Allocated memory is still 2.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 166.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* 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;
[L710] 0 _Bool main$tmp_guard0;
[L711] 0 _Bool main$tmp_guard1;
[L713] 0 int x = 0;
[L715] 0 int y = 0;
[L717] 0 int z = 0;
[L718] 0 _Bool z$flush_delayed;
[L719] 0 int z$mem_tmp;
[L720] 0 _Bool z$r_buff0_thd0;
[L721] 0 _Bool z$r_buff0_thd1;
[L722] 0 _Bool z$r_buff0_thd2;
[L723] 0 _Bool z$r_buff0_thd3;
[L724] 0 _Bool z$r_buff1_thd0;
[L725] 0 _Bool z$r_buff1_thd1;
[L726] 0 _Bool z$r_buff1_thd2;
[L727] 0 _Bool z$r_buff1_thd3;
[L728] 0 _Bool z$read_delayed;
[L729] 0 int *z$read_delayed_var;
[L730] 0 int z$w_buff0;
[L731] 0 _Bool z$w_buff0_used;
[L732] 0 int z$w_buff1;
[L733] 0 _Bool z$w_buff1_used;
[L734] 0 _Bool weak$$choice0;
[L735] 0 _Bool weak$$choice2;
[L816] 0 pthread_t t2489;
[L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L818] 0 pthread_t t2490;
[L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L820] 0 pthread_t t2491;
[L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L739] 1 z$w_buff1 = z$w_buff0
[L740] 1 z$w_buff0 = 2
[L741] 1 z$w_buff1_used = z$w_buff0_used
[L742] 1 z$w_buff0_used = (_Bool)1
[L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3
[L748] 1 z$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L768] 2 x = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L771] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L788] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L791] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L825] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L825] RET 0 assume_abort_if_not(main$tmp_guard0)
[L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L834] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L835] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L836] 0 z$flush_delayed = weak$$choice2
[L837] 0 z$mem_tmp = z
[L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2)
[L846] 0 z = z$flush_delayed ? z$mem_tmp : z
[L847] 0 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L849] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
- 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: 814]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 819]: 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: 821]: 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: 817]: 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, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2176 IncrementalHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 69 mSDtfsCounter, 2176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1090occurred in iteration=10, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-24 01:50:35,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC --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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 01:50:38,553 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 01:50:38,673 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-24 01:50:38,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 01:50:38,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 01:50:38,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 01:50:38,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 01:50:38,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 01:50:38,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 01:50:38,726 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 01:50:38,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 01:50:38,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 01:50:38,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 01:50:38,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 01:50:38,729 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 01:50:38,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 01:50:38,729 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 01:50:38,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 01:50:38,729 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 01:50:38,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 01:50:38,729 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 01:50:38,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:50:38,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:50:38,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:50:38,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-24 01:50:38,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 01:50:38,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 01:50:38,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 01:50:38,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 01:50:38,732 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC
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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6
[2024-11-24 01:50:39,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 01:50:39,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 01:50:39,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 01:50:39,132 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 01:50:39,133 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 01:50:39,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 01:50:42,278 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/9c419c201/4762d7d8ec684424896b4427b8792f9f/FLAG799906cb7
[2024-11-24 01:50:42,640 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 01:50:42,640 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 01:50:42,662 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/9c419c201/4762d7d8ec684424896b4427b8792f9f/FLAG799906cb7
[2024-11-24 01:50:42,685 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/data/9c419c201/4762d7d8ec684424896b4427b8792f9f
[2024-11-24 01:50:42,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 01:50:42,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 01:50:42,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 01:50:42,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 01:50:42,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 01:50:42,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:50:42" (1/1) ...
[2024-11-24 01:50:42,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638af3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:42, skipping insertion in model container
[2024-11-24 01:50:42,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:50:42" (1/1) ...
[2024-11-24 01:50:42,750 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 01:50:43,280 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:50:43,301 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 01:50:43,401 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:50:43,451 INFO L204 MainTranslator]: Completed translation
[2024-11-24 01:50:43,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43 WrapperNode
[2024-11-24 01:50:43,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 01:50:43,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 01:50:43,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 01:50:43,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 01:50:43,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,511 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137
[2024-11-24 01:50:43,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 01:50:43,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 01:50:43,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 01:50:43,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 01:50:43,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,541 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-24 01:50:43,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 01:50:43,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 01:50:43,562 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 01:50:43,562 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 01:50:43,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (1/1) ...
[2024-11-24 01:50:43,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:50:43,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:43,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 01:50:43,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 01:50:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 01:50:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 01:50:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-24 01:50:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-24 01:50:43,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-24 01:50:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-24 01:50:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-24 01:50:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-24 01:50:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-24 01:50:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 01:50:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 01:50:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 01:50:43,630 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 01:50:43,775 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 01:50:43,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 01:50:44,251 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 01:50:44,251 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 01:50:44,545 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 01:50:44,546 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-24 01:50:44,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:50:44 BoogieIcfgContainer
[2024-11-24 01:50:44,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 01:50:44,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 01:50:44,549 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 01:50:44,555 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 01:50:44,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:50:42" (1/3) ...
[2024-11-24 01:50:44,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc8b693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:50:44, skipping insertion in model container
[2024-11-24 01:50:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:50:43" (2/3) ...
[2024-11-24 01:50:44,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc8b693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:50:44, skipping insertion in model container
[2024-11-24 01:50:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:50:44" (3/3) ...
[2024-11-24 01:50:44,559 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-24 01:50:44,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 01:50:44,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations.
[2024-11-24 01:50:44,577 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 01:50:44,677 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 01:50:44,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow
[2024-11-24 01:50:44,772 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-11-24 01:50:44,778 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:50:44,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place.
[2024-11-24 01:50:44,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow
[2024-11-24 01:50:44,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow
[2024-11-24 01:50:44,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:50:44,819 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@58004014, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:50:44,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-24 01:50:44,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:50:44,828 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-24 01:50:44,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:50:44,829 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:44,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-24 01:50:44,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 11936538, now seen corresponding path program 1 times
[2024-11-24 01:50:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001814330]
[2024-11-24 01:50:44,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:44,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:44,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:44,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:44,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-24 01:50:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:45,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:45,007 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:45,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:45,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001814330]
[2024-11-24 01:50:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001814330] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:45,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:45,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:50:45,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86731643]
[2024-11-24 01:50:45,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:45,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:50:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:45,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:50:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:50:45,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44
[2024-11-24 01:50:45,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:45,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:45,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44
[2024-11-24 01:50:45,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:45,602 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events.
[2024-11-24 01:50:45,603 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES.
[2024-11-24 01:50:45,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place.
[2024-11-24 01:50:45,621 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions.
[2024-11-24 01:50:45,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow
[2024-11-24 01:50:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:50:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:50:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions.
[2024-11-24 01:50:45,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75
[2024-11-24 01:50:45,641 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions.
[2024-11-24 01:50:45,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow
[2024-11-24 01:50:45,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 01:50:45,652 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow
[2024-11-24 01:50:45,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-11-24 01:50:45,662 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places.
[2024-11-24 01:50:45,663 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow
[2024-11-24 01:50:45,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:45,663 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:45,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:45,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-24 01:50:45,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:45,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:45,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 18908189, now seen corresponding path program 1 times
[2024-11-24 01:50:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104150931]
[2024-11-24 01:50:45,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:45,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:45,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:45,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:45,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-24 01:50:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:46,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:46,014 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:46,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:46,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104150931]
[2024-11-24 01:50:46,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104150931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:46,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:46,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:50:46,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732030198]
[2024-11-24 01:50:46,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:46,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:50:46,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:46,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:50:46,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:50:46,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44
[2024-11-24 01:50:46,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:46,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:46,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44
[2024-11-24 01:50:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:46,404 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events.
[2024-11-24 01:50:46,405 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES.
[2024-11-24 01:50:46,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7018 event pairs, 605 based on Foata normal form. 36/1123 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place.
[2024-11-24 01:50:46,421 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions.
[2024-11-24 01:50:46,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow
[2024-11-24 01:50:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:50:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:50:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions.
[2024-11-24 01:50:46,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182
[2024-11-24 01:50:46,424 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions.
[2024-11-24 01:50:46,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow
[2024-11-24 01:50:46,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:50:46,426 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow
[2024-11-24 01:50:46,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34}
[2024-11-24 01:50:46,428 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places.
[2024-11-24 01:50:46,428 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow
[2024-11-24 01:50:46,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:46,429 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:46,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:46,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-24 01:50:46,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:46,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash 18909800, now seen corresponding path program 1 times
[2024-11-24 01:50:46,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:46,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56665293]
[2024-11-24 01:50:46,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:46,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:46,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:46,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:46,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-24 01:50:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:46,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:46,748 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:46,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:46,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56665293]
[2024-11-24 01:50:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56665293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:50:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017832851]
[2024-11-24 01:50:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:46,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 01:50:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:46,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 01:50:46,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 01:50:46,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-24 01:50:46,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:46,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:46,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-24 01:50:46,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:47,350 INFO L124 PetriNetUnfolderBase]: 1363/2295 cut-off events.
[2024-11-24 01:50:47,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:50:47,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 2295 events. 1363/2295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13820 event pairs, 149 based on Foata normal form. 80/2328 useless extension candidates. Maximal degree in co-relation 4407. Up to 1297 conditions per place.
[2024-11-24 01:50:47,367 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions.
[2024-11-24 01:50:47,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 218 flow
[2024-11-24 01:50:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 01:50:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-24 01:50:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions.
[2024-11-24 01:50:47,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636
[2024-11-24 01:50:47,370 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 108 transitions.
[2024-11-24 01:50:47,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 218 flow
[2024-11-24 01:50:47,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 01:50:47,372 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow
[2024-11-24 01:50:47,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37}
[2024-11-24 01:50:47,373 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places.
[2024-11-24 01:50:47,374 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow
[2024-11-24 01:50:47,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:47,374 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:47,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:50:47,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-24 01:50:47,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:47,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:47,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash 763898825, now seen corresponding path program 1 times
[2024-11-24 01:50:47,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:47,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960373036]
[2024-11-24 01:50:47,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:47,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:47,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:47,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-24 01:50:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:47,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:47,689 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:47,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:47,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:47,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960373036]
[2024-11-24 01:50:47,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960373036] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:47,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:47,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 01:50:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916452348]
[2024-11-24 01:50:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:47,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:50:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:47,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:50:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:50:47,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-24 01:50:47,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:47,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:47,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-24 01:50:47,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:48,163 INFO L124 PetriNetUnfolderBase]: 879/1511 cut-off events.
[2024-11-24 01:50:48,163 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES.
[2024-11-24 01:50:48,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1511 events. 879/1511 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8068 event pairs, 75 based on Foata normal form. 68/1540 useless extension candidates. Maximal degree in co-relation 3431. Up to 625 conditions per place.
[2024-11-24 01:50:48,173 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions.
[2024-11-24 01:50:48,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 314 flow
[2024-11-24 01:50:48,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:50:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:50:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions.
[2024-11-24 01:50:48,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182
[2024-11-24 01:50:48,176 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 136 transitions.
[2024-11-24 01:50:48,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 314 flow
[2024-11-24 01:50:48,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-24 01:50:48,179 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow
[2024-11-24 01:50:48,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40}
[2024-11-24 01:50:48,180 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places.
[2024-11-24 01:50:48,181 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow
[2024-11-24 01:50:48,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:48,181 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:48,181 INFO L206 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]
[2024-11-24 01:50:48,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-24 01:50:48,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:48,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:48,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1947523095, now seen corresponding path program 1 times
[2024-11-24 01:50:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:48,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932903814]
[2024-11-24 01:50:48,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:48,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:48,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:48,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:48,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-24 01:50:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:48,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:48,506 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:48,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:48,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932903814]
[2024-11-24 01:50:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932903814] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:50:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502867302]
[2024-11-24 01:50:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:48,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:48,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:48,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44
[2024-11-24 01:50:48,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:48,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:48,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44
[2024-11-24 01:50:48,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:48,977 INFO L124 PetriNetUnfolderBase]: 491/839 cut-off events.
[2024-11-24 01:50:48,977 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES.
[2024-11-24 01:50:48,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 839 events. 491/839 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3707 event pairs, 61 based on Foata normal form. 36/841 useless extension candidates. Maximal degree in co-relation 2167. Up to 268 conditions per place.
[2024-11-24 01:50:48,982 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions.
[2024-11-24 01:50:48,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 325 flow
[2024-11-24 01:50:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:50:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:50:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions.
[2024-11-24 01:50:48,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606
[2024-11-24 01:50:48,985 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 148 transitions.
[2024-11-24 01:50:48,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 325 flow
[2024-11-24 01:50:48,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-24 01:50:48,990 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow
[2024-11-24 01:50:48,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40}
[2024-11-24 01:50:48,991 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places.
[2024-11-24 01:50:48,991 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow
[2024-11-24 01:50:48,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:48,991 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:48,991 INFO L206 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]
[2024-11-24 01:50:49,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-24 01:50:49,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:49,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:49,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1445209619, now seen corresponding path program 1 times
[2024-11-24 01:50:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2128702709]
[2024-11-24 01:50:49,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:50:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:49,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:49,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:49,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-24 01:50:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:50:49,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:49,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:49,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128702709]
[2024-11-24 01:50:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128702709] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-24 01:50:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457967087]
[2024-11-24 01:50:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:49,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-24 01:50:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:49,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-24 01:50:49,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-11-24 01:50:49,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-24 01:50:49,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:49,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:49,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-24 01:50:49,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:50,387 INFO L124 PetriNetUnfolderBase]: 505/962 cut-off events.
[2024-11-24 01:50:50,387 INFO L125 PetriNetUnfolderBase]: For 390/411 co-relation queries the response was YES.
[2024-11-24 01:50:50,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 962 events. 505/962 cut-off events. For 390/411 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4898 event pairs, 201 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 2205. Up to 484 conditions per place.
[2024-11-24 01:50:50,394 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 25 selfloop transitions, 4 changer transitions 14/62 dead transitions.
[2024-11-24 01:50:50,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 305 flow
[2024-11-24 01:50:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:50:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:50:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-11-24 01:50:50,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793
[2024-11-24 01:50:50,396 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 163 transitions.
[2024-11-24 01:50:50,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 305 flow
[2024-11-24 01:50:50,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 238 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-11-24 01:50:50,408 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 134 flow
[2024-11-24 01:50:50,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=42}
[2024-11-24 01:50:50,409 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places.
[2024-11-24 01:50:50,409 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 134 flow
[2024-11-24 01:50:50,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:50,409 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:50,409 INFO L206 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]
[2024-11-24 01:50:50,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-24 01:50:50,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:50,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:50,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1188579421, now seen corresponding path program 2 times
[2024-11-24 01:50:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905937396]
[2024-11-24 01:50:50,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 01:50:50,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:50,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:50,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:50,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-24 01:50:50,727 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:50:50,727 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:50:50,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:50,732 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:51,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:51,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905937396]
[2024-11-24 01:50:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905937396] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:51,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-24 01:50:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856816664]
[2024-11-24 01:50:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:51,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-24 01:50:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:51,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-24 01:50:51,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-24 01:50:51,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44
[2024-11-24 01:50:51,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:51,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:51,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44
[2024-11-24 01:50:51,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:51,880 INFO L124 PetriNetUnfolderBase]: 573/1092 cut-off events.
[2024-11-24 01:50:51,880 INFO L125 PetriNetUnfolderBase]: For 206/215 co-relation queries the response was YES.
[2024-11-24 01:50:51,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 1092 events. 573/1092 cut-off events. For 206/215 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5843 event pairs, 239 based on Foata normal form. 8/1032 useless extension candidates. Maximal degree in co-relation 2380. Up to 404 conditions per place.
[2024-11-24 01:50:51,889 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 24 selfloop transitions, 4 changer transitions 16/63 dead transitions.
[2024-11-24 01:50:51,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 273 flow
[2024-11-24 01:50:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-24 01:50:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-24 01:50:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-11-24 01:50:51,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793
[2024-11-24 01:50:51,896 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 134 flow. Second operand 7 states and 163 transitions.
[2024-11-24 01:50:51,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 273 flow
[2024-11-24 01:50:51,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 258 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-11-24 01:50:51,900 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 142 flow
[2024-11-24 01:50:51,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=42}
[2024-11-24 01:50:51,901 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places.
[2024-11-24 01:50:51,905 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 142 flow
[2024-11-24 01:50:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:51,905 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:51,906 INFO L206 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]
[2024-11-24 01:50:51,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-24 01:50:52,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:52,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:52,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash 50392787, now seen corresponding path program 3 times
[2024-11-24 01:50:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655690264]
[2024-11-24 01:50:52,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 01:50:52,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:52,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:52,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:52,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-24 01:50:52,207 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-24 01:50:52,207 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:50:52,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:52,213 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:52,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:52,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655690264]
[2024-11-24 01:50:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655690264] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:52,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:52,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:50:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952442032]
[2024-11-24 01:50:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:52,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:52,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:52,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:52,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:52,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-24 01:50:52,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:52,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:52,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-24 01:50:52,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:52,849 INFO L124 PetriNetUnfolderBase]: 657/1209 cut-off events.
[2024-11-24 01:50:52,849 INFO L125 PetriNetUnfolderBase]: For 318/351 co-relation queries the response was YES.
[2024-11-24 01:50:52,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1209 events. 657/1209 cut-off events. For 318/351 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6523 event pairs, 305 based on Foata normal form. 12/1137 useless extension candidates. Maximal degree in co-relation 2764. Up to 603 conditions per place.
[2024-11-24 01:50:52,857 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 31 selfloop transitions, 2 changer transitions 19/70 dead transitions.
[2024-11-24 01:50:52,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 329 flow
[2024-11-24 01:50:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:50:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:50:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions.
[2024-11-24 01:50:52,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242
[2024-11-24 01:50:52,860 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 142 flow. Second operand 6 states and 145 transitions.
[2024-11-24 01:50:52,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 329 flow
[2024-11-24 01:50:52,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 299 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-11-24 01:50:52,865 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 138 flow
[2024-11-24 01:50:52,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=42}
[2024-11-24 01:50:52,867 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places.
[2024-11-24 01:50:52,867 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 138 flow
[2024-11-24 01:50:52,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:52,868 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:52,869 INFO L206 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]
[2024-11-24 01:50:52,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-24 01:50:53,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:53,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:53,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:53,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1799298273, now seen corresponding path program 4 times
[2024-11-24 01:50:53,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240783207]
[2024-11-24 01:50:53,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 01:50:53,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:53,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:53,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-24 01:50:53,173 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 01:50:53,173 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:50:53,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-24 01:50:53,177 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 01:50:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:50:53,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 01:50:53,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 01:50:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240783207]
[2024-11-24 01:50:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240783207] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:50:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:50:53,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:50:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380519581]
[2024-11-24 01:50:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:50:53,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:50:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 01:50:53,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:50:53,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:50:53,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44
[2024-11-24 01:50:53,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:53,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:50:53,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44
[2024-11-24 01:50:53,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:50:53,620 INFO L124 PetriNetUnfolderBase]: 497/946 cut-off events.
[2024-11-24 01:50:53,620 INFO L125 PetriNetUnfolderBase]: For 251/255 co-relation queries the response was YES.
[2024-11-24 01:50:53,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 946 events. 497/946 cut-off events. For 251/255 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4575 event pairs, 201 based on Foata normal form. 12/924 useless extension candidates. Maximal degree in co-relation 2058. Up to 409 conditions per place.
[2024-11-24 01:50:53,625 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 27 selfloop transitions, 2 changer transitions 21/68 dead transitions.
[2024-11-24 01:50:53,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 309 flow
[2024-11-24 01:50:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:50:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:50:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions.
[2024-11-24 01:50:53,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-11-24 01:50:53,628 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 138 flow. Second operand 6 states and 143 transitions.
[2024-11-24 01:50:53,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 309 flow
[2024-11-24 01:50:53,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 291 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-11-24 01:50:53,632 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 140 flow
[2024-11-24 01:50:53,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=42}
[2024-11-24 01:50:53,632 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places.
[2024-11-24 01:50:53,633 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 140 flow
[2024-11-24 01:50:53,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:50:53,633 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:50:53,633 INFO L206 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]
[2024-11-24 01:50:53,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-11-24 01:50:53,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:53,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-24 01:50:53,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:50:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1880925251, now seen corresponding path program 5 times
[2024-11-24 01:50:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 01:50:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504184322]
[2024-11-24 01:50:53,836 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-24 01:50:53,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:53,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:50:53,838 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 01:50:53,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-24 01:50:53,950 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:50:53,951 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-24 01:50:53,951 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:50:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:50:54,075 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-24 01:50:54,075 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:50:54,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-24 01:50:54,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-24 01:50:54,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-24 01:50:54,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-24 01:50:54,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-24 01:50:54,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-24 01:50:54,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-24 01:50:54,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-11-24 01:50:54,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 01:50:54,280 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2024-11-24 01:50:54,365 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-24 01:50:54,365 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 01:50:54,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:50:54 BasicIcfg
[2024-11-24 01:50:54,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 01:50:54,375 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 01:50:54,375 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 01:50:54,375 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 01:50:54,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:50:44" (3/4) ...
[2024-11-24 01:50:54,378 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-24 01:50:54,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 01:50:54,380 INFO L158 Benchmark]: Toolchain (without parser) took 11689.63ms. Allocated memory was 109.1MB in the beginning and 176.2MB in the end (delta: 67.1MB). Free memory was 83.8MB in the beginning and 93.8MB in the end (delta: -10.0MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB.
[2024-11-24 01:50:54,380 INFO L158 Benchmark]: CDTParser took 4.12ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:50:54,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.39ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 60.2MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-24 01:50:54,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.85ms. Allocated memory is still 109.1MB. Free memory was 60.2MB in the beginning and 57.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:50:54,381 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 109.1MB. Free memory was 57.9MB in the beginning and 55.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:50:54,381 INFO L158 Benchmark]: RCFGBuilder took 984.49ms. Allocated memory is still 109.1MB. Free memory was 54.9MB in the beginning and 36.8MB in the end (delta: 18.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB.
[2024-11-24 01:50:54,382 INFO L158 Benchmark]: TraceAbstraction took 9825.54ms. Allocated memory was 109.1MB in the beginning and 176.2MB in the end (delta: 67.1MB). Free memory was 36.1MB in the beginning and 93.8MB in the end (delta: -57.7MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB.
[2024-11-24 01:50:54,382 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 176.2MB. Free memory was 93.8MB in the beginning and 93.8MB in the end (delta: 14.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:50:54,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 4.12ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 761.39ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 60.2MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 58.85ms. Allocated memory is still 109.1MB. Free memory was 60.2MB in the beginning and 57.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 48.60ms. Allocated memory is still 109.1MB. Free memory was 57.9MB in the beginning and 55.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 984.49ms. Allocated memory is still 109.1MB. Free memory was 54.9MB in the beginning and 36.8MB in the end (delta: 18.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 9825.54ms. Allocated memory was 109.1MB in the beginning and 176.2MB in the end (delta: 67.1MB). Free memory was 36.1MB in the beginning and 93.8MB in the end (delta: -57.7MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB.
* Witness Printer took 3.90ms. Allocated memory is still 176.2MB. Free memory was 93.8MB in the beginning and 93.8MB in the end (delta: 14.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* 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;
[L710] 0 _Bool main$tmp_guard0;
[L711] 0 _Bool main$tmp_guard1;
[L713] 0 int x = 0;
[L715] 0 int y = 0;
[L717] 0 int z = 0;
[L718] 0 _Bool z$flush_delayed;
[L719] 0 int z$mem_tmp;
[L720] 0 _Bool z$r_buff0_thd0;
[L721] 0 _Bool z$r_buff0_thd1;
[L722] 0 _Bool z$r_buff0_thd2;
[L723] 0 _Bool z$r_buff0_thd3;
[L724] 0 _Bool z$r_buff1_thd0;
[L725] 0 _Bool z$r_buff1_thd1;
[L726] 0 _Bool z$r_buff1_thd2;
[L727] 0 _Bool z$r_buff1_thd3;
[L728] 0 _Bool z$read_delayed;
[L729] 0 int *z$read_delayed_var;
[L730] 0 int z$w_buff0;
[L731] 0 _Bool z$w_buff0_used;
[L732] 0 int z$w_buff1;
[L733] 0 _Bool z$w_buff1_used;
[L734] 0 _Bool weak$$choice0;
[L735] 0 _Bool weak$$choice2;
[L816] 0 pthread_t t2489;
[L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L739] 1 z$w_buff1 = z$w_buff0
[L740] 1 z$w_buff0 = 2
[L741] 1 z$w_buff1_used = z$w_buff0_used
[L742] 1 z$w_buff0_used = (_Bool)1
[L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3
[L748] 1 z$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L818] 0 pthread_t t2490;
[L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, t2490=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L820] 0 pthread_t t2491;
[L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L768] 2 x = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L771] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L788] 3 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L791] 3 z = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L825] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L825] RET 0 assume_abort_if_not(main$tmp_guard0)
[L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L834] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L835] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L836] 0 z$flush_delayed = weak$$choice2
[L837] 0 z$mem_tmp = z
[L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2)
[L846] 0 z = z$flush_delayed ? z$mem_tmp : z
[L847] 0 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L849] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
- 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: 814]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 819]: 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: 821]: 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: 817]: 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, 68 locations, 7 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: 9.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 994 IncrementalHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 20 mSDtfsCounter, 994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 229 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1005 SizeOfPredicates, 25 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-24 01:50:54,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c44ad6b-8dce-4571-9f86-7cc699e2ab13/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample